forked from menault/TD3_DEV51_Qualite_Algo
Compare commits
1 Commits
2_Maxime_a
...
4_Marvin_N
| Author | SHA1 | Date | |
|---|---|---|---|
| c476e3ae53 |
62
main.java
62
main.java
@@ -1,11 +1,60 @@
|
||||
import java.util.Scanner;
|
||||
import java.util.*;
|
||||
|
||||
public class main {
|
||||
public String word = word_search.getRandomWord();
|
||||
public Letter curentLetter = new Letter(word);
|
||||
public int nbError=0;
|
||||
public boolean winCondition=false;
|
||||
public String word; // mot courant
|
||||
public Letter curentLetter; // gestion lettres
|
||||
public int nbError = 0; // erreurs
|
||||
public boolean winCondition = false;
|
||||
|
||||
// Stockage des mots par difficulté
|
||||
public String easyWord;
|
||||
public String mediumWord;
|
||||
public String hardWord1;
|
||||
public String hardWord2;
|
||||
|
||||
public main() {
|
||||
// ---------------------------------------------------
|
||||
// 1️⃣ Récupération des mots aléatoires pour chaque difficulté
|
||||
// ---------------------------------------------------
|
||||
ArrayList<String> allWords = new ArrayList<>();
|
||||
allWords.add(word_search.getRandomWord()); // exemple simple
|
||||
allWords.add(word_search.getRandomWord());
|
||||
allWords.add(word_search.getRandomWord());
|
||||
allWords.add(word_search.getRandomWord());
|
||||
|
||||
// Trier par longueur pour facile/moyen
|
||||
for (String w : allWords) {
|
||||
if (w.length() < 8 && easyWord == null) easyWord = w;
|
||||
else if (w.length() >= 8 && mediumWord == null) mediumWord = w;
|
||||
else if (hardWord1 == null) hardWord1 = w;
|
||||
else if (hardWord2 == null) hardWord2 = w;
|
||||
}
|
||||
|
||||
// ---------------------------------------------------
|
||||
// 2️⃣ Choix de la difficulté
|
||||
// ---------------------------------------------------
|
||||
Scanner sc = new Scanner(System.in);
|
||||
System.out.println("Choisis la difficulté : facile / moyen / difficile");
|
||||
String choice = sc.nextLine().toLowerCase();
|
||||
|
||||
switch (choice) {
|
||||
case "facile":
|
||||
word = easyWord;
|
||||
break;
|
||||
case "moyen":
|
||||
word = mediumWord;
|
||||
break;
|
||||
case "difficile":
|
||||
// Ici on choisira les 2 mots pour faire deviner
|
||||
word = hardWord1 + " " + hardWord2;
|
||||
break;
|
||||
default:
|
||||
System.out.println("Difficulté invalide, on prend facile par défaut");
|
||||
word = easyWord;
|
||||
}
|
||||
|
||||
curentLetter = new Letter(word);
|
||||
}
|
||||
//creer wincondtion (je lis le mot en construction (wordbuilding), compare avec word, si égal c'est gagné)
|
||||
public boolean winCondition(){
|
||||
if(curentLetter.wordBuilding.toString().equals(word)){
|
||||
@@ -97,9 +146,10 @@ public class main {
|
||||
displayHangman(nbError);
|
||||
System.out.println("mot a trouver " + this.curentLetter.wordBuilding);
|
||||
}
|
||||
|
||||
//Ligne 100
|
||||
//Permet au jeu de fonctionner et de se terminer
|
||||
public void game(){
|
||||
showGame();
|
||||
while(nbError<6 && !winCondition()){
|
||||
char letter = enter_word.getLetter();
|
||||
this.curentLetter.setLetter(letter);
|
||||
|
||||
Reference in New Issue
Block a user