Advertisement
MirkoVa

hele ding

Sep 15th, 2014
245
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 4.36 KB | None | 0 0
  1. import java.util.Scanner;
  2. import java.lang.String;
  3.  
  4. //alles nog bij elkaar zetten!
  5. public class Opgave2
  6. {
  7. public static void main(String args[])
  8. {
  9. String zin = getInput();
  10. System.out.println("");
  11. System.out.println("Originele zin:\t\t" + zin);
  12. System.out.println("Lengte zin:\t\t" + zin.length() + " tekens");
  13. zin = filterZin(zin);
  14. System.out.println("Gefilterde zin:\t\t" + zin);
  15.  
  16. String gefilterdeZin = filterZin(zin);
  17. System.out.println("Lengte gefilterde zin:\t" + gefilterdeZin.length() + " tekens");
  18.  
  19. int aantalWoorden = woorden(zin);
  20. System.out.println("Aantal woorden:\t\t" + aantalWoorden);
  21.  
  22. int aantalKlinkers = klinkers(zin);
  23. System.out.println("Aantal klinkers:\t" + aantalKlinkers);
  24.  
  25. String tweedeFilter = tweedeFilter(zin);
  26. boolean palindroom = palindroom(zin);
  27. System.out.println("Is het een palindroom?\t" + palindroom);
  28.  
  29. int[] frequentie = frequentie(zin);
  30.  
  31. }
  32.  
  33.  
  34. static String getInput()
  35. {
  36. Scanner scan = new Scanner(System.in);
  37. String zin = " ";
  38.  
  39. System.out.println("Voer een zin in: ");
  40. if (scan.hasNextLine())
  41. zin = scan.nextLine().trim();
  42.  
  43. if (zin.equals(""))
  44. {
  45. System.out.println("Geen invoer!");
  46. System.exit(0);
  47. }
  48. return zin;
  49. }
  50.  
  51.  
  52. static String filterZin(String zin)
  53. {
  54. String gefilterdeZin = "";
  55. for(int i=0; i < zin.length(); i++)
  56. {
  57. zin = zin.trim();
  58. char c = zin.charAt(i);
  59. if(c >= 'A' && c <= 'Z')
  60. {
  61. c = ((char)(c + 32));
  62. gefilterdeZin = gefilterdeZin + c;
  63. }
  64.  
  65. else if(c >= '0' && c <= '9' ||c >= 'a' && c <= 'z'
  66. ||c == ' ' && zin.charAt(i-1) != ' ')
  67. gefilterdeZin = gefilterdeZin + c;
  68.  
  69. }
  70.  
  71. return gefilterdeZin;
  72. }
  73.  
  74.  
  75. static int woorden(String zin)
  76. {
  77. int aantalWoorden = 0;
  78. for(int i = 0; i < zin.length(); i++)
  79. {
  80. char c = zin.charAt(i);
  81. if(i == 0 || zin.charAt(i-1) == ' ' && c != ' ')
  82. aantalWoorden = aantalWoorden + 1;
  83. }
  84. return aantalWoorden;
  85. }
  86.  
  87.  
  88. static int klinkers(String zin)
  89. {
  90. int aantalKlinkers = 0;
  91. for(int i = 0; i < zin.length(); i++)
  92. {
  93. char c = zin.charAt(i);
  94. if(c == 'a' || c == 'e' ||c == 'i'||c == 'o'||c == 'u'||c == 'y')
  95. aantalKlinkers = aantalKlinkers + 1;
  96.  
  97. }
  98. return aantalKlinkers;
  99. }
  100.  
  101. static String tweedeFilter(String zin)
  102. {
  103. String tweedeFilter = "";
  104. for(int i=0; i < zin.length(); i++)
  105. {
  106. char c = zin.charAt(i);
  107. if(c != ' ')
  108. tweedeFilter = tweedeFilter + c;
  109. }
  110. return tweedeFilter;
  111. }
  112.  
  113. static boolean palindroom(String zin)
  114. {
  115. int pdroom = 0;
  116. boolean palindroom = false;
  117. for(int i = 0; i < zin.length(); i++)
  118. {
  119. char c = zin.charAt(i);
  120. char d = zin.charAt(zin.length()-1-i);
  121. if(c == d)
  122. pdroom = pdroom + 1;
  123. }
  124. if(pdroom == zin.length())
  125. palindroom = true;
  126.  
  127. return palindroom;
  128. }
  129.  
  130. static int[] frequentie(String zin)
  131. {
  132.  
  133. int[] frequentie = new int[37];
  134. for(int i = 0; i < zin.length(); i++)
  135. {
  136. char c = zin.charAt(i);
  137. if(c >= 'a' && c <= 'z')
  138. frequentie[c-97] = frequentie[c-97] + 1;
  139. else if(c > '0' && c <= '9')
  140. frequentie[c-22] = frequentie[c-22] + 1;
  141. else if(c == ' ')
  142. frequentie[c+4] = frequentie[c+4] + 1;
  143. }
  144. System.out.println("--------------------------------------------------------------------------");
  145. System.out.println("Ter controle de frequenties van alle karakters: ");
  146. System.out.println(" ");
  147. int max = frequentie[0];
  148. double stapgrootte = 0;
  149. double sterretjes = 0;
  150. for(int i = 0; i < frequentie.length; i++)
  151. {
  152. System.out.print(frequentie[i] + " ");
  153.  
  154. if(frequentie[i] > max)
  155. max = frequentie[i];
  156. }
  157.  
  158. if(max <= 10)
  159. stapgrootte = 1;
  160. else if(max > 10)
  161. stapgrootte = max/10;
  162.  
  163. for(int i = max; i > 0; i--)
  164. {
  165. System.out.println(" ");
  166. for(int h = 0; h < 37; h++)
  167. {
  168. sterretjes = frequentie[i]/stapgrootte;
  169. if (sterretjes <= i && sterretjes > 0 && i == 1 || sterretjes >= i)
  170. System.out.print("* ");
  171. else
  172. System.out.print(" ");
  173. }
  174. }
  175. System.out.println(" ");
  176. System.out.println("a b c d e f g h i j k l m n o p q r s t u v w x y z 0 1 2 3 4 5 6 7 8 9 ");
  177. System.out.println(" ");
  178. System.out.println("De max is " + max + " en de stappgrootte is " + stapgrootte);
  179. System.out.println("--------------------------------------------------------------------------");
  180.  
  181. return frequentie;
  182.  
  183. }
  184.  
  185. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement