{"id":3052,"date":"2020-01-06T13:11:20","date_gmt":"2020-01-06T12:11:20","guid":{"rendered":"https:\/\/www.webotlet.hu\/?p=3052"},"modified":"2020-01-06T13:27:26","modified_gmt":"2020-01-06T12:27:26","slug":"java-programozas-2010-oktoberi-emelt-informatika-erettsegi-anagramma-1-verzio","status":"publish","type":"post","link":"https:\/\/www.webotlet.hu\/?p=3052","title":{"rendered":"Java programoz\u00e1s \u2013 2010 okt\u00f3beri emelt informatika \u00e9retts\u00e9gi \u2013 anagramma (1. verzi\u00f3)"},"content":{"rendered":"

A feladat le\u00edr\u00e1s\u00e1t, melynek a megold\u00e1s\u00e1t k\u00f6zz\u00e9teszem innen<\/a> t\u00f6ltheted le. Ez a megold\u00e1s t\u00f6mbbel dolgozik.
\nAdatt\u00e1rol\u00f3 oszt\u00e1ly:<\/p>\n

\r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_10okt_anagram;\r\n\r\npublic class Szo\r\n{\r\n  private String szo;\r\n  private String abc;\r\n  \r\n  public Szo(String szo)\r\n  {\r\n    this.szo = szo;\r\n    \r\n    \/\/ minden szo betuit mar a letrehozasakor rendezzuk\r\n    char[] tomb = szo.toCharArray();\r\n    for( int i = 0; i < tomb.length-1; i++ )\r\n    {\r\n      for( int j = i + 1; j < tomb.length; j++ )\r\n      {\r\n        if(tomb[i] > tomb[j])\r\n        {\r\n          char csere = tomb[i];\r\n          tomb[i] = tomb[j];\r\n          tomb[j] = csere;\r\n        }\r\n      }\r\n    }\r\n    abc = new String(tomb);\r\n  }\r\n\r\n  public String getAbc()\r\n  {\r\n    return abc;\r\n  }\r\n\r\n  public String getSzo()\r\n  {\r\n    return szo;\r\n  }\r\n\r\n  @Override\r\n  public String toString()\r\n  {\r\n    return "Szo{" + "szo=" + szo + ", abc=" + abc + '}';\r\n  }\r\n}\r\n<\/pre>\n
A feladat megold\u00e1sai:<\/p>\n
\r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_10okt_anagram;\r\n\r\nimport java.io.IOException;\r\nimport java.io.RandomAccessFile;\r\nimport java.util.Scanner;\r\n\r\npublic class Webotlet_10okt_anagram\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n    \r\n    System.out.println("1. feladat");\r\n    System.out.println("Adja meg a szoveget:");\r\n    Scanner sc = new Scanner(System.in);\r\n    String szo = sc.nextLine();\r\n    \r\n    char[] betuk = szo.toCharArray();\r\n    \r\n    int[] betukDb = new int[((int)'z') + 1];\r\n    \r\n    for( int i = 0; i < betuk.length; i++)\r\n    {\r\n      betukDb[ (int)betuk[i] ]++;\r\n    }\r\n    \r\n    for( int i = 0; i < betukDb.length; i++ )\r\n    {\r\n      if(betukDb[i] > 0)\r\n      {\r\n        System.out.println(betukDb[i] + " " + (char)i);\r\n      }\r\n    }\r\n    \r\n    RandomAccessFile raf;\r\n    String sor;\r\n    Szo[] szavak = null;\r\n    \r\n    try\r\n    {\r\n      raf = new RandomAccessFile("szotar.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      raf.seek(0);\r\n      szavak = new Szo[db];\r\n      \r\n      int hely = 0;\r\n      for(sor = raf.readLine(); sor != null; sor = raf.readLine())\r\n      {\r\n        szavak[hely] = new Szo(sor);\r\n        hely++;\r\n      }\r\n      raf.close();\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 < szavak.length; i++ )\r\n\/\/    {\r\n\/\/      System.out.println(szavak[i].toString());\r\n\/\/    }\r\n    \r\n    try\r\n    {\r\n      RandomAccessFile ki = new RandomAccessFile("abc.txt", "rw");\r\n      ki.setLength(0);\r\n      \r\n      for( int i = 0; i < szavak.length; i++ )\r\n      {\r\n        ki.writeBytes(szavak[i].getAbc() + "\\n");\r\n      }\r\n      ki.close();\r\n    }\r\n    catch(IOException e)\r\n    {\r\n      System.out.println("HIBA");\r\n    }\r\n    \r\n    System.out.println("4. feladat");\r\n    \r\n    String szo1;\r\n    String szo2;\r\n    System.out.print("1. szo: ");\r\n    szo1 = sc.nextLine();\r\n    System.out.print("2. szo: ");\r\n    szo2 = sc.nextLine();\r\n    \r\n    if( rendezett(szo1).equals(rendezett(szo2 )) )\r\n    {\r\n      System.out.println("Anagramma");\r\n    }\r\n    else\r\n    {\r\n      System.out.println("Nem anagramma");\r\n    }\r\n\r\n    System.out.println("5. feladat Adj meg egy szot!");\r\n      \r\n    Scanner sc2 = new Scanner(System.in);\r\n    String feladat5 = sc2.nextLine();\r\n    \r\n    feladat5 = rendezett(feladat5);\r\n     \r\n    for( int i = 0; i < szavak.length; i++ )\r\n    {\r\n      if( szavak[i].getAbc().equals(feladat5) )\r\n      {\r\n        System.out.println(szavak[i].getSzo());\r\n      }\r\n    }\r\n    \r\n    System.out.println("6. feladat");\r\n    int maxhossz = szavak[0].getSzo().length();\r\n    for( int i = 0; i < szavak.length; i++ )\r\n    {\r\n      if( szavak[i].getSzo().length() > maxhossz )\r\n      {\r\n        maxhossz = szavak[i].getSzo().length();\r\n      }\r\n    }\r\n    \r\n    int db = 0;\r\n    for( int i = 0; i < szavak.length; i++ )\r\n    {\r\n      if( szavak[i].getSzo().length() == maxhossz )\r\n      {\r\n        db++;\r\n      }\r\n    }\r\n    \r\n    Szo[] leghosszabb = new Szo[db];\r\n    int hely = 0;\r\n    for( int i = 0; i < szavak.length; i++ )\r\n    {\r\n      if( szavak[i].getSzo().length() == maxhossz )\r\n      {\r\n        leghosszabb[hely] = szavak[i];\r\n        hely++;\r\n      }\r\n    }\r\n    \r\n    for( int i = 0; i < leghosszabb.length - 1; i++ )\r\n    {\r\n      for( int j = i + 1; j < leghosszabb.length; j++ )\r\n      {\r\n        if( leghosszabb[i].getAbc().compareTo(leghosszabb[j].getAbc()) > 0)\r\n        {\r\n          Szo csere = leghosszabb[i];\r\n          leghosszabb[i] = leghosszabb[j];\r\n          leghosszabb[j] = csere;\r\n        }\r\n      }\r\n    }\r\n    \r\n    for( int i = 0; i < leghosszabb.length; i++ )\r\n    {\r\n      System.out.println(leghosszabb[i].getSzo());\r\n    }\r\n    \r\n    Szo[] rendezett = new Szo[szavak.length];\r\n    \r\n    for( int i = 0; i < szavak.length - 1; i++ )\r\n    {\r\n      for( int j = i + 1; j < szavak.length; j++ )\r\n      {\r\n        if( szavak[i].getSzo().length() > szavak[j].getSzo().length()\r\n          || (szavak[i].getSzo().length() == szavak[j].getSzo().length()\r\n              && szavak[i].getAbc().compareTo(szavak[j].getAbc()) > 0 ) )\r\n        {\r\n          Szo csere = szavak[i];\r\n          szavak[i] = szavak[j];\r\n          szavak[j] = csere;        }\r\n      }\r\n    }\r\n    \r\n    try\r\n    {\r\n      RandomAccessFile ki = new RandomAccessFile("rendezve.txt", "rw");\r\n      ki.setLength(0);\r\n      \r\n      ki.writeBytes(szavak[0].getSzo());\r\n      for( int i = 1; i < szavak.length; i++ )\r\n      {\r\n        if( szavak[i].getAbc().equals(szavak[i - 1].getAbc()))\r\n        {\r\n          ki.writeBytes(" " + szavak[i].getSzo());\r\n        }\r\n        else if( szavak[i].getSzo().length() == szavak[i - 1].getSzo().length() )\r\n        {\r\n          ki.writeBytes("\\n" + szavak[i].getSzo());\r\n        }\r\n        else\r\n        {\r\n          ki.writeBytes("\\n\\n" + szavak[i].getSzo());\r\n        }\r\n      }\r\n      ki.close();\r\n    }\r\n    catch( IOException e )\r\n    {\r\n      System.out.println(e.getMessage());\r\n      System.out.println("HIBA");\r\n    }\r\n\r\n  }\r\n  \r\n  \/\/ egy tetszoleges szo betuinek abc rendezese\r\n  public static String rendezett( String szo )\r\n  {\r\n    char[] tomb = szo.toCharArray();\r\n    for( int i = 0; i < tomb.length - 1; i++ )\r\n    {\r\n      for( int j = i + 1; j < tomb.length; j++ )\r\n      {\r\n        if(tomb[i] > tomb[j])\r\n        {\r\n          char csere = tomb[i];\r\n          tomb[i] = tomb[j];\r\n          tomb[j] = csere;\r\n        }\r\n      }\r\n    }\r\n    return new String(tomb);\r\n  }\r\n}\r\n<\/pre>\n
Ha hib\u00e1t tal\u00e1lsz benne, k\u00e9rlek jelezd!<\/p>\n","protected":false},"excerpt":{"rendered":"
A feladat le\u00edr\u00e1s\u00e1t, melynek a megold\u00e1s\u00e1t k\u00f6zz\u00e9teszem innen t\u00f6ltheted le. Ez a megold\u00e1s t\u00f6mbbel dolgozik. Adatt\u00e1rol\u00f3 oszt\u00e1ly: \/** * * @author https:\/\/webotlet.hu *\/ package webotlet_10okt_anagram; public class Szo { private String szo; private String abc; public Szo(String szo) { this.szo Tov\u00e1bb   Java programoz\u00e1s \u2013 2010 okt\u00f3beri emelt informatika \u00e9retts\u00e9gi \u2013 anagramma (1. verzi\u00f3)<\/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":[106],"tags":[108,107,109,86,144,143,183,25,26,15],"class_list":["post-3052","post","type-post","status-publish","format-standard","hentry","category-java-emelt-erettsegi-feladatok","tag-emelt","tag-emelt-erettsegi","tag-emelt-informatika-erettsegi","tag-java","tag-java_programozas","tag-programozas","tag-programozas-feladat","tag-randomaccessfile","tag-szovegfajl","tag-tomb"],"_links":{"self":[{"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts\/3052","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=3052"}],"version-history":[{"count":3,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts\/3052\/revisions"}],"predecessor-version":[{"id":3058,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts\/3052\/revisions\/3058"}],"wp:attachment":[{"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=3052"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=3052"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=3052"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}