Advertisement
Guest User

Untitled

a guest
Feb 20th, 2017
80
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.00 KB | None | 0 0
  1. import java.util.Scanner;
  2. public class Bored {
  3. public static Scanner sc = new Scanner(System.in);
  4. public static void main(String [] args) {
  5. boolean game = true;
  6. String[] words = new String[]{"beta","kappa","theta","alpha" };
  7. String[] letters = new String[]{"a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q"};
  8. String[] letters2 = new String[] {"r","s","t","u","v","w","x","y","z"};
  9. String[] hangman = new String[10];
  10. String l_1 = letters[0]+letters[1]+letters[2]+letters[3]+letters[4]+letters[5]+letters[6]+letters[7]+letters[8];
  11. String l_2 = letters[9]+letters[10]+letters[11]+letters[12]+letters[13]+letters[14]+letters[15]+letters[16];
  12. String l_3 = letters2[0]+letters2[1]+letters2[2]+letters2[3]+letters2[4]+letters2[5]+letters2[6]+letters2[7]+letters2[8];
  13. String final_word = words[(int)(Math.random()*4)];
  14. System.out.println("DEBUG: WORD IS "+final_word);
  15. String[] hangman_word = new String[10];
  16. for(int i = 0; i <= final_word.length() -1; i++) {
  17. hangman_word[i] = final_word.substring(i, i+1);
  18. }
  19. for(int l = 0; l < hangman_word.length -4; l++) {
  20. hangman[l] = "-";
  21. }
  22. while(game) {
  23. System.out.println(hangman[0]+hangman[1]+hangman[2]+hangman[3]+hangman[4]);
  24. System.out.println("\n Available letters:"+l_1+""+l_2+""+l_3);
  25. String yourChar = sc.nextLine();
  26. for(int n = 0; n <= hangman_word.length -1; n++) {
  27. if(yourChar.equalsIgnoreCase(hangman_word[n])) {
  28. hangman[n] = yourChar;
  29. }
  30. }
  31. for(int o = 0; o <= (letters2.length)-1; o++) {
  32. if(yourChar.equalsIgnoreCase(letters2[o])) {
  33. letters2[o] = "";
  34. }
  35. }
  36. for(int p = 0; p <= (letters.length)-1; p++) {
  37. if(yourChar.equalsIgnoreCase(letters[p])) {
  38. letters[p] = "";
  39. }
  40. }
  41. }
  42. }
  43. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement