{"id":2533,"date":"2019-09-25T14:37:30","date_gmt":"2019-09-25T12:37:30","guid":{"rendered":"http:\/\/www.webotlet.hu\/?p=2533"},"modified":"2019-09-25T14:37:55","modified_gmt":"2019-09-25T12:37:55","slug":"a-fajlkezeles-7-feladat-megoldasa-java-nyelven-2","status":"publish","type":"post","link":"https:\/\/www.webotlet.hu\/?p=2533","title":{"rendered":"A F\u00e1jlkezel\u00e9s 4. feladat megold\u00e1sa Java nyelven"},"content":{"rendered":"

A feladat aminek a megold\u00e1s\u00e1t itt k\u00f6zz\u00e9teszem, itt<\/a> tal\u00e1lhat\u00f3. A feladatot csak forr\u00e1sk\u00f3dk\u00e9nt teszem k\u00f6zz\u00e9. Az utols\u00f3 feladat megold\u00e1s\u00e1t k\u00e9s\u0151bb teszem hozz\u00e1.<\/p>\n

\r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_fajlkezeles04;\r\n\r\nimport java.io.IOException;\r\nimport java.io.RandomAccessFile;\r\n\r\npublic class Webotlet_Fajlkezeles04\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n    RandomAccessFile raf;\r\n    String sor;\r\n    String[] nevek = null;\r\n    try\r\n    {\r\n      raf = new RandomAccessFile("nevek.txt", "r");\r\n      int db = 0;\r\n      for (sor = raf.readLine(); sor != null; sor = raf.readLine())\r\n      {\r\n        db++;\r\n      }\r\n      nevek = new String[db];\r\n      raf.seek(0);\r\n      int hely = 0;\r\n      for (sor = raf.readLine(); sor != null; sor = raf.readLine())\r\n      {\r\n        nevek[hely] = sor;\r\n        hely++;\r\n      }\r\n    }\r\n    catch(IOException e)\r\n    {\r\n      System.out.println("HIBA");\r\n    }\r\n     \r\n\/\/    for (int i = 0; i < nevek.length; i++)\r\n\/\/    {\r\n\/\/      System.out.println(nevek[i]);\r\n\/\/    }\r\n\/\/    System.out.println();\r\n     \r\n    System.out.println("1. feladat");\r\n\/\/  Kinek van a leghosszabb vezet\u00e9kneve?\r\n    String[] vezeteknevek;\r\n    vezeteknevek = new String[nevek.length];\r\n    for (int i = 0; i < vezeteknevek.length; i++)\r\n    {\r\n      vezeteknevek[i] = nevek[i].split(" ")[0];\r\n    }\r\n     \r\n\/\/    for (int i = 0; i < vezeteknevek.length; i++)\r\n\/\/    {\r\n\/\/      System.out.println(vezeteknevek[i]);\r\n\/\/    }\r\n     \r\n    int max = 0;\r\n    for (int i = 1; i < vezeteknevek.length; i++)\r\n    {\r\n      if (vezeteknevek[i].length() > vezeteknevek[max].length())\r\n      {\r\n        max = i;\r\n      }\r\n    }\r\n     \r\n    System.out.println("A leghosszabb vezetekneve: "+nevek[max]);\r\n     \r\n    System.out.println("2. feladat");\r\n\/\/ Kinek van k\u00e9t keresztneve?\r\n    for( int i = 0;i < nevek.length; i++ )\r\n    {\r\n      if( nevek[i].split(" ").length > 2 )\r\n      {\r\n        System.out.println(nevek[i]);\r\n      }\r\n    }\r\n\r\n    System.out.println("3. feladat");\r\n\/\/ H\u00e1nyadik a leghosszabb n\u00e9v a f\u00e1jlban?\r\n    int maxHosszHely = 0;\r\n    for( int i = 1; i < nevek.length; i++ )\r\n    {\r\n      if( nevek[i].length() > nevek[maxHosszHely].length() )\r\n      {\r\n        maxHosszHely = i;\r\n      }\r\n    }\r\n    \r\n    System.out.println("A leghosszabb nev sorszama: "+(maxHosszHely+1));\r\n\r\n    System.out.println("4. feladat");\r\n\/\/ Melyik n\u00e9vben van a legt\u00f6bb n bet\u0171?\r\n\/\/ 1. verzi\u00f3 (helyben megsz\u00e1molva, darabsz\u00e1mok t\u00f6bbe rakva)\r\n    int[] nBetukDb = new int[nevek.length];\r\n    for( int i = 0; i < nevek.length; i++ )\r\n    {\r\n      String nev = nevek[i].toLowerCase();\r\n      int db = 0;\r\n      for (int j = 0; j < nev.length(); j++)\r\n      {\r\n        if (nev.charAt(j) == 'n')\r\n        {\r\n          db++;\r\n        }\r\n      }\r\n      nBetukDb[i] = db;\r\n    }\r\n    \r\n    int maxN = 0;\r\n    for( int i = 1; i < nBetukDb.length; i++ )\r\n    {\r\n      if( nBetukDb[i] > nBetukDb[maxN] )\r\n      {\r\n        maxN = i;\r\n      }\r\n    }\r\n    \r\n    System.out.println("A legtobb n betu ebben a nevben van: "+\r\n        nevek[maxN]);\r\n\r\n\/\/ 2. verzi\u00f3 (met\u00f3dussal)\r\n    int max2 = 0;\r\n    for (int i = 1; i < nevek.length; i++)\r\n    {\r\n      if (nBetuk(nevek[i]) > nBetuk(nevek[max2]))\r\n      {\r\n        max2 = i;\r\n      }\r\n    }\r\n    System.out.println("A legtobb n betu ebben a nevben van: "+\r\n        nevek[max2]);\r\n     \r\n\/\/ 3. verzi\u00f3 (split finoms\u00e1gokkal)\r\n    int max3 = 0;\r\n    for( int i = 1; i < nevek.length; i++ )\r\n    {\r\n      if( nevek[i].split("n|N",-1).length-1 > \r\n          nevek[max3].split("n|N",-1).length-1)\r\n      {\r\n        max3 = i;\r\n      }\r\n    }\r\n    System.out.println("A legtobb n betu ebben a nevben van: "+\r\n        nevek[max3]);\r\n\r\n    System.out.println("5. feladat");\r\n\/\/ Vannak-e azonos vezet\u00e9knev\u0171 emberek?\r\n \r\n\/\/ mindet mindegyikkel osszehasonlithatjuk\r\n    boolean azonosVezetek = false;\r\n    for (int i = 0; i < vezeteknevek.length-1; i++)\r\n    {\r\n      for (int j = i+1; j < vezeteknevek.length; j++)\r\n      {\r\n        if( vezeteknevek[i].equals(vezeteknevek[j]))\r\n        {\r\n           azonosVezetek = true;\r\n           break;\r\n        }\r\n      }\r\n    }\r\n    \r\n    if( azonosVezetek )\r\n    {\r\n      System.out.println("Vannak azonos vezeteknevu "\r\n          + "emberek.");\r\n    }\r\n    else\r\n    {\r\n      System.out.println("Nincsenek azonos vezeteknevu "\r\n          + "emberek.");\r\n    }\r\n\r\n    System.out.println("6. feladat");\r\n\/\/    Vannak-e azonos keresztnev\u0171 emberek?\r\n\/\/    (minden keresztn\u00e9vnek egyeznie kell)\r\n    String[] keresztnevek = new String[nevek.length];\r\n    for( int i = 0; i < nevek.length; i++ )\r\n    {\r\n      keresztnevek[i] = nevek[i].split(" ",2)[1];\r\n    }\r\n    \r\n\/\/ mindet mindegyikkel osszehasonlithatjuk\r\n    boolean azonosKereszt = false;\r\n    for (int i = 0; i < keresztnevek.length-1; i++)\r\n    {\r\n      for (int j = i+1; j < keresztnevek.length; j++)\r\n      {\r\n        if( keresztnevek[i].equals(keresztnevek[j]))\r\n        {\r\n           azonosKereszt = true;\r\n           break;\r\n        }\r\n      }\r\n    }\r\n    \r\n    if( azonosKereszt )\r\n    {\r\n      System.out.println("Vannak teljesen azonos "\r\n          + "keresztnevu emberek.");\r\n    }\r\n    else\r\n    {\r\n      System.out.println("Nincsenek teljesenazonos "\r\n          + "keresztnevu emberek.");\r\n    }\r\n\r\n\/\/ 7. feladat megold\u00e1sa k\u00e9s\u0151bb\r\n     \r\n  }\r\n   \r\n  public static int nBetuk(String nev)\r\n  {\r\n\/\/    hogy az n \u00e9s N bet\u0171ket ne k\u00fcl\u00f6nb\u00f6ztess\u00fck meg\r\n    nev = nev.toLowerCase();\r\n    int db = 0;\r\n    for (int i = 0; i < nev.length(); i++)\r\n    {\r\n      if (nev.charAt(i) == 'n')\r\n      {\r\n        db++;\r\n      }\r\n    }\r\n    return db;\r\n  }  \r\n}\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"
A feladat aminek a megold\u00e1s\u00e1t itt k\u00f6zz\u00e9teszem, itt tal\u00e1lhat\u00f3. A feladatot csak forr\u00e1sk\u00f3dk\u00e9nt teszem k\u00f6zz\u00e9. Az utols\u00f3 feladat megold\u00e1s\u00e1t k\u00e9s\u0151bb teszem hozz\u00e1. \/** * * @author https:\/\/webotlet.hu *\/ package webotlet_fajlkezeles04; import java.io.IOException; import java.io.RandomAccessFile; public class Webotlet_Fajlkezeles04 { public static Tov\u00e1bb   A F\u00e1jlkezel\u00e9s 4. feladat megold\u00e1sa Java nyelven<\/span>→<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[211],"tags":[51,27,57,31,47,22,43,90,66,144,60,89,87,104,61,143,183,194,25,29,26,15,163],"class_list":["post-2533","post","type-post","status-publish","format-standard","hentry","category-java-fajlkezeles-feladatok","tag-alap-algoritmus","tag-alap-algoritmusok","tag-boolean","tag-ciklus","tag-ciklusok","tag-fajlkezeles","tag-feltetel-vizsgalat","tag-feltetelvizsgalat","tag-for","tag-java_programozas","tag-karakterlanc","tag-maximumkereses","tag-megszamlalas","tag-megszamolas","tag-metodus","tag-programozas","tag-programozas-feladat","tag-programozasi-tetelek","tag-randomaccessfile","tag-string","tag-szovegfajl","tag-tomb","tag-tombok"],"_links":{"self":[{"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts\/2533","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=2533"}],"version-history":[{"count":2,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts\/2533\/revisions"}],"predecessor-version":[{"id":2536,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts\/2533\/revisions\/2536"}],"wp:attachment":[{"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=2533"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=2533"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=2533"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}