Advertisement
Guest User

Untitled

a guest
Dec 11th, 2017
66
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.25 KB | None | 0 0
  1. import java.io.File;
  2. import java.io.FileNotFoundException;
  3. import java.util.ArrayList;
  4. import java.util.Collections;
  5. import java.util.List;
  6. import java.util.Scanner;
  7.  
  8.  
  9. class Fajlok implements Comparable<Fajlok>
  10. {
  11. public String nev;
  12. public List<String> sorok = new ArrayList<>();
  13.  
  14. public Fajlok(String Nev)
  15. {
  16. this.nev = Nev;
  17. sorok = new ArrayList<>();
  18. }
  19.  
  20. @Override
  21. public String toString() {
  22. StringBuilder sb = new StringBuilder(nev + ":\n");
  23. for (int i = 0; i < sorok.size(); i++)
  24. {
  25. sb.append(sorok.get(i));
  26. if (i < sorok.size() - 1)
  27. sb.append("\n");
  28. }
  29.  
  30. return sb.toString();
  31. }
  32.  
  33.  
  34.  
  35. @Override
  36. public int compareTo(Fajlok t) {
  37. return this.nev.compareTo(t.nev);
  38. }
  39.  
  40. }
  41. public class Teszt {
  42.  
  43. public static void main(String[] args)
  44. {
  45. List<Fajlok> lista = new ArrayList<Fajlok>();
  46. for (String item : args)
  47. {
  48. try
  49. {
  50. Scanner sc = new Scanner(new File(item));
  51. String sor;
  52. lista.add(new Fajlok(item));
  53. int max = 0;
  54. List<String> tmp = new ArrayList<>();
  55. while (sc.hasNextLine())
  56. {
  57. tmp.add(sc.nextLine());
  58. }
  59.  
  60. for (int i = 0; i < tmp.size(); i++)
  61. {
  62. if (tmp.get(i).length() > max)
  63. max = tmp.get(i).length();
  64. }
  65.  
  66. for (int i = 0; i < tmp.size(); i++)
  67. {
  68. if (tmp.get(i).length() == max)
  69. lista.get(lista.size() - 1).sorok.add(tmp.get(i));
  70. }
  71. }
  72. catch (FileNotFoundException ex)
  73. {
  74.  
  75. }
  76. }
  77.  
  78. Collections.sort(lista);
  79.  
  80. for (Fajlok item : lista)
  81. {
  82. System.out.println(item);
  83. }
  84. }
  85. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement