Advertisement
Guest User

Untitled

a guest
Sep 19th, 2017
64
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.90 KB | None | 0 0
  1. import java.util.*;
  2. import java.io.*;
  3. public class C
  4. {
  5. public static void main(String[] args) throws Throwable
  6. {
  7. Scanner read = new Scanner(new File("src/textA.txt"));
  8.  
  9. String word[] = new String[1000];
  10. int leng[] = new int[1000];
  11. int n = 0;
  12. int m = 0;
  13.  
  14. while(read.hasNext())
  15. {
  16. word[n] = read.next();
  17.  
  18. for(int i=0;i<word[n].length();i++)
  19. {
  20. if((int)word[n].charAt(i)==45)
  21. m++;
  22.  
  23. for(int j=97;j<123;j++)
  24. if((int)word[n].charAt(i)==j)
  25. m++;
  26.  
  27. for(int j=65;j<91;j++)
  28. if((int)word[n].charAt(i)==j)
  29. m++;
  30. }
  31.  
  32. leng[n] = m;
  33.  
  34. if(word[n].equals("E-N-D"))
  35. break;
  36.  
  37. n++;
  38. m = 0;
  39. }
  40.  
  41. int maxL=leng[0],maxN = 0;
  42. for(int i = 1;i<n;i++)
  43. {
  44. if(leng[i]>maxL)
  45. {
  46. maxL=leng[i];
  47. maxN=i;
  48. }
  49. }
  50. System.out.println(word[maxN].toLowerCase());
  51. }
  52. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement