{"id":1577,"date":"2015-08-16T23:26:03","date_gmt":"2015-08-16T21:26:03","guid":{"rendered":"http:\/\/www.webotlet.hu\/?p=1577"},"modified":"2015-10-23T21:28:28","modified_gmt":"2015-10-23T19:28:28","slug":"java-programozas-novenyek-megoldasa-nem-teljes","status":"publish","type":"post","link":"https:\/\/www.webotlet.hu\/?p=1577","title":{"rendered":"Java programoz\u00e1s \u2013 N\u00f6v\u00e9nyek megold\u00e1sa (nem teljes)"},"content":{"rendered":"<h3>A feladat megold\u00e1sa m\u00e9g nem teljes!<\/h3>\n<h3>Csak akkor olvass tov\u00e1bb, ha a <a href=\"http:\/\/www.webotlet.hu\/?p=898\">n\u00f6v\u00e9nyek<\/a> feladatot megoldottad, vagy nem siker\u00fclt megoldani.<\/h3>\n<p>A <a href=\"http:\/\/www.webotlet.hu\/wp-content\/uploads\/2015\/08\/Webotlet_novenyek.7z\">let\u00f6lthet\u0151<\/a> t\u00f6m\u00f6r\u00edtett \u00e1llom\u00e1nyban megtal\u00e1lod a NetBeans-ben megnyithat\u00f3 projectet. Amennyiben Geany szerkeszt\u0151vel k\u00edv\u00e1nod megtekinteni a megold\u00e1st, akkor t\u00f6r\u00f6ld ki a forr\u00e1sok elej\u00e9r\u0151l a k\u00f6vetkez\u0151 sorokat:<\/p>\n<pre class=\"brush: java; title: ; notranslate\" title=\"\">\r\npackage webotlet_novenyek;\r\n<\/pre>\n<p>A megold\u00e1sban k\u00e9t oszt\u00e1ly tal\u00e1lhat\u00f3. A Noveny oszt\u00e1ly felel\u0151s az adatt\u00e1rol\u00e1s\u00e9rt, a Webotlet_novenyek pedig a vez\u00e9rl\u0151program, mely a forr\u00e1s beolvas\u00e1s\u00e1t, valamint a feladatok megold\u00e1s\u00e1t tartalmazza.<br \/>\nNoveny oszt\u00e1ly az adatt\u00e1rol\u00e1sra:<\/p>\n<pre class=\"brush: java; title: ; notranslate\" title=\"\">\r\n\/**\r\n\u00a0*\r\n\u00a0* @author http:\/\/webotlet.hu\r\n\u00a0*\/\r\npackage webotlet_novenyek;\r\n\r\npublic class Noveny\r\n{\r\n\r\n\u00a0 private String nev;\r\n\u00a0 private String miert;\r\n\u00a0 private int kezd;\r\n\u00a0 private int veg;\r\n\u00a0 private int gyido;\r\n\u00a0 private int&#x5B;] honapok;\r\n\r\n\u00a0 public Noveny( String&#x5B;] tomb )\r\n\u00a0 {\r\n\u00a0\u00a0\u00a0 nev = tomb&#x5B;0];\r\n\u00a0\u00a0\u00a0 miert = tomb&#x5B;1];\r\n\u00a0\u00a0\u00a0 kezd = Integer.parseInt( tomb&#x5B;2] );\r\n\u00a0\u00a0\u00a0 veg = Integer.parseInt( tomb&#x5B;3] );\r\n\u00a0\u00a0\u00a0 if( kezd &lt;= veg )\r\n\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 gyido = veg - kezd + 1;\r\n\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0 else\r\n\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 gyido = 13 - kezd + veg;\r\n\u00a0\u00a0\u00a0 }\r\n\r\n\u00a0\u00a0\u00a0 honapok = ekkorGyujtik();\r\n\u00a0 }\r\n\r\n\u00a0 public String getNev()\r\n\u00a0 {\r\n\u00a0\u00a0\u00a0 return nev;\r\n\u00a0 }\r\n\r\n\u00a0 public String getMiert()\r\n\u00a0 {\r\n\u00a0\u00a0\u00a0 return miert;\r\n\u00a0 }\r\n\r\n\u00a0 public int getKezd()\r\n\u00a0 {\r\n\u00a0\u00a0\u00a0 return kezd;\r\n\u00a0 }\r\n\r\n\u00a0 public int getVeg()\r\n\u00a0 {\r\n\u00a0\u00a0\u00a0 return veg;\r\n\u00a0 }\r\n\r\n\u00a0 public int getGyido()\r\n\u00a0 {\r\n\u00a0\u00a0\u00a0 return gyido;\r\n\u00a0 }\r\n\r\n\u00a0 public int&#x5B;] getHonapok()\r\n\u00a0 {\r\n\u00a0\u00a0\u00a0 return honapok;\r\n\u00a0 }\r\n\r\n\u00a0 private int&#x5B;] ekkorGyujtik()\r\n\u00a0 {\r\n\u00a0\u00a0\u00a0 int&#x5B;] tomb = new int&#x5B;gyido];\r\n\u00a0\u00a0\u00a0 int db = 0;\r\n\u00a0\u00a0\u00a0 if( kezd &lt;= veg )\r\n\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 for (int i = kezd; i &lt;= veg; i++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 tomb&#x5B;db++] = i;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0 else\r\n\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 for (int i = kezd; i &lt; 13; i++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 tomb&#x5B;db++] = i;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 for (int i = 1; i &lt;= veg; i++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 tomb&#x5B;db++] = i;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0 return tomb;\r\n\u00a0 }\r\n\r\n\u00a0 public String ekkorGyujtikString()\r\n\u00a0 {\r\n\u00a0\u00a0\u00a0 StringBuilder sb = new StringBuilder();\r\n\u00a0\u00a0\u00a0 for (int i : honapok)\r\n\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 sb.append( i + &quot; &quot; );\r\n\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0 return sb.toString();\r\n\u00a0 }\r\n\r\n\u00a0 public boolean gyujtikEkkor( int honap )\r\n\u00a0 {\r\n\u00a0\u00a0\u00a0 return honap &gt;= kezd &amp;&amp; honap &lt;= veg;\r\n\u00a0 }\r\n\r\n\u00a0 @Override\r\n\u00a0 public String toString()\r\n\u00a0 {\r\n\u00a0\u00a0\u00a0 return &quot;Noveny{&quot; + &quot;nev=&quot; + nev + &quot;, miert=&quot; + miert +\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 &quot;, kezd=&quot; + kezd + &quot;, veg=&quot; + veg + &quot;, gyido=&quot; +\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 gyido + &quot;, honapok=&quot; + ekkorGyujtikString() + '}';\r\n\u00a0 }\r\n\r\n}\r\n<\/pre>\n<p>A main()-t tartalmaz\u00f3 oszt\u00e1ly, mely a f\u00e1jlkezel\u00e9st \u00e9s a feladatokat tartalmazza:<\/p>\n<pre class=\"brush: java; title: ; notranslate\" title=\"\">\r\n\/**\r\n\u00a0*\r\n\u00a0* @author http:\/\/webotlet.hu\r\n\u00a0*\/\r\npackage webotlet_novenyek;\r\n\r\nimport java.io.*;\r\n\r\npublic class Webotlet_novenyek\r\n{\r\n\r\n\u00a0 public static void main( String&#x5B;] args )\r\n\u00a0 {\r\n\u00a0\u00a0\u00a0 RandomAccessFile raf;\r\n\u00a0\u00a0\u00a0 String sor;\r\n\u00a0\u00a0\u00a0 Noveny&#x5B;] novenyek;\r\n\u00a0\u00a0\u00a0 int db;\r\n\u00a0\u00a0\u00a0 try\r\n\u00a0\u00a0\u00a0 {\r\n\/\/ 1. feladat\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 raf = new RandomAccessFile( &quot;noveny.txt&quot;, &quot;r&quot; );\r\n\/\/ sorok megszamlalasa\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 db = 0;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 for (sor = raf.readLine(); sor != null; sor = raf.readLine())\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 db++;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 novenyek = new Noveny&#x5B;db];\r\n\/\/ adatok beolvasasa\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 db = 0;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 raf.seek( 0 );\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 for (sor = raf.readLine(); sor != null; sor = raf.readLine())\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 novenyek&#x5B;db++] = new Noveny( sor.split( &quot;;&quot; ) );\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 \/*\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 for( Noveny n : novenyek)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( n.toString() );\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 *\/\r\n\/\/ 2. feladat\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( &quot;\\n2. feladat&quot; );\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 for (Noveny n : novenyek)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if( n.getNev().equalsIgnoreCase( &quot;gyongyvirag&quot; ) )\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( n.getMiert() );\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 break;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\/\/ 3. feladat\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( &quot;\\n3. feladat&quot; );\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 int leveldb = 0;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 for (Noveny n : novenyek)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if( n.getMiert().equals( &quot;level&quot; ) )\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 leveldb++;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( &quot;Ennyi novenyt gyujtenek a leveleert: &quot;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 + leveldb );\r\n\/\/ 4. feladat\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( &quot;\\n4. feladat&quot; );\r\n\/\/\u00a0\u00a0 0 1 2 3 4 5 6 7 8 9 10 11 12\r\n\/\/ { 0,0,0,0,0,1,2,0,0,0, 0, 0, 0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 int&#x5B;] honapKezdDb = new int&#x5B;12];\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 for (int i = 0; i &lt; novenyek.length; i++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 honapKezdDb&#x5B;novenyek&#x5B;i].getKezd() - 1]++;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 int kezdMax = 0;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 for (int i = 1; i &lt; honapKezdDb.length; i++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if( honapKezdDb&#x5B;i] &gt; honapKezdDb&#x5B;kezdMax] )\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 kezdMax = i;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 for (int i = 0; i &lt; honapKezdDb.length; i++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if( honapKezdDb&#x5B;i] == honapKezdDb&#x5B;kezdMax] )\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( &quot;A &quot; + (i + 1) + &quot;. honapban kezdik &quot;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 + &quot;gyujteni a legtobb novenyt.&quot; );\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\r\n\/\/ 5. feladat\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( &quot;\\n5. feladat&quot; );\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 for (int i = 1; i &lt; honapKezdDb.length; i++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if( honapKezdDb&#x5B;i] == 0 )\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( &quot;A &quot; + (i + 1) + &quot;. honapban semmit &quot;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 + &quot;nem kezdenek gyujteni.&quot; );\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\r\n\/\/ 6. feladat\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( &quot;\\n6. feladat&quot; );\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 int egyszodb = 0;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 for (int i = 0; i &lt; novenyek.length; i++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if( novenyek&#x5B;i].getNev().contains( &quot; &quot; ) )\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 egyszodb++;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( &quot;Ennyi noveny neve all egy szobol: &quot; + egyszodb );\r\n\r\n\/\/ 7. feladat\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( &quot;\\n7. feladat&quot; );\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 int osszel = 0;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 for (int i = 0; i &lt; novenyek.length; i++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if( novenyek&#x5B;i].getKezd() &gt;= 9 &amp;&amp; novenyek&#x5B;i].getKezd() &lt;= 11 )\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 osszel++;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( &quot;Ennyi novenyt gyujtenek kezdenek &quot;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 + &quot;osszel gyujteni: &quot; + osszel );\r\n\r\n\/\/ 8. feladat\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( &quot;\\n8. feladat&quot; );\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 int nyarElejeDb = 0;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 for (int i = 0; i &lt; novenyek.length; i++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if( novenyek&#x5B;i].getKezd() == 6 )\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 nyarElejeDb++;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( &quot;Ennyi novenyt gyujtenek a nyar elejetol: &quot;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 + nyarElejeDb );\r\n\r\n\/\/ 9. feladat\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( &quot;\\n9. feladat&quot; );\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 int maxGyIdo = 0;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 for (int i = 1; i &lt; novenyek.length; i++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if( novenyek&#x5B;i].getGyido() &gt; novenyek&#x5B;maxGyIdo].getGyido() )\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 maxGyIdo = i;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 for (int i = 0; i &lt; novenyek.length; i++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if( novenyek&#x5B;i].getGyido() == novenyek&#x5B;maxGyIdo].getGyido() )\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( novenyek&#x5B;i].getNev() );\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\r\n\/\/ 10. feladat\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( &quot;\\n10. feladat&quot; );\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 String csalan = &quot;&quot;;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 for (int i = 0; i &lt; novenyek.length; i++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if( novenyek&#x5B;i].getNev().equalsIgnoreCase( &quot;csalan&quot; ) )\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 csalan = novenyek&#x5B;i].getMiert();\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 break;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 for (int i = 0; i &lt; novenyek.length; i++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if( novenyek&#x5B;i].getMiert().equals( csalan )\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 &amp;&amp; !novenyek&#x5B;i].getNev().equalsIgnoreCase( &quot;csalan&quot; ) )\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( novenyek&#x5B;i].getNev() );\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\r\n\/\/ 11. feladat\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( &quot;\\n11. feladat&quot; );\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 int viragdb = 0;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 for (int i = 0; i &lt; novenyek.length; i++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if( novenyek&#x5B;i].getMiert().toLowerCase().contains( &quot;virag&quot; ) )\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 viragdb++;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( &quot;Ennyi novenyt gyujtenek viraggal &quot;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 + &quot;kapcsolatban: &quot; + viragdb );\r\n\r\n\/\/ 13. feladat\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 boolean van = false;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( &quot;\\n13. feladat&quot; );\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 for (int i = 0; i &lt; honapKezdDb.length; i++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if( honapKezdDb&#x5B;i] == 0 )\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 van = true;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 break;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 if( van )\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( &quot;Van olyan honap, amikor semmit nem &quot;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 + &quot;kezdenek gyujteni.&quot; );\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 else\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( &quot;Nincs olyan honap, amikor semmit &quot;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 + &quot;nem kezdenek gyujteni.&quot; );\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\r\n\/\/ 14. feladat\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( &quot;\\n14. feladat&quot; );\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 int&#x5B;] honapGyujtDb = new int&#x5B;12];\r\n\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 for (int i = 0; i &lt; novenyek.length; i++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 for (int j = 0; j &lt; novenyek&#x5B;i].getHonapok().length; j++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 honapGyujtDb&#x5B;novenyek&#x5B;i].getHonapok()&#x5B;j] - 1]++;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 int honapGyujtMax = 0;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 for (int i = 0; i &lt; honapGyujtDb.length; i++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if( honapGyujtDb&#x5B;i] &gt; honapGyujtDb&#x5B;honapGyujtMax] )\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 honapGyujtMax = i;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 for (int i = 0; i &lt; honapGyujtDb.length; i++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if( honapGyujtDb&#x5B;i] == honapGyujtDb&#x5B;honapGyujtMax] )\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( (i + 1) + &quot;. honapban gyujtik a legtobb &quot;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 + &quot;fajta novenyt.&quot; );\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\r\n\/\/ 15. feladat\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( &quot;\\n15. feladat&quot; );\r\n\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 Noveny csere;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 for (int i = 0; i &lt; novenyek.length - 1; i++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 for (int j = i + 1; j &lt; novenyek.length; j++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if( novenyek&#x5B;i].getKezd() &gt; novenyek&#x5B;j].getKezd() )\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 csere = novenyek&#x5B;i];\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 novenyek&#x5B;i] = novenyek&#x5B;j];\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 novenyek&#x5B;j] = csere;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 for (Noveny n : novenyek)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( n.toString() );\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0 catch ( IOException e )\r\n\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println( &quot;HIBA&quot; );\r\n\u00a0\u00a0\u00a0 }\r\n\u00a0 }\r\n}\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>A feladat megold\u00e1sa m\u00e9g nem teljes! Csak akkor olvass tov\u00e1bb, ha a n\u00f6v\u00e9nyek feladatot megoldottad, vagy nem siker\u00fclt megoldani. A let\u00f6lthet\u0151 t\u00f6m\u00f6r\u00edtett \u00e1llom\u00e1nyban megtal\u00e1lod a NetBeans-ben megnyithat\u00f3 projectet. Amennyiben Geany szerkeszt\u0151vel k\u00edv\u00e1nod megtekinteni a megold\u00e1st, akkor t\u00f6r\u00f6ld ki a forr\u00e1sok <a class=\"more-link\" href=\"https:\/\/www.webotlet.hu\/?p=1577\">Tov\u00e1bb <span class=\"screen-reader-text\">  Java programoz\u00e1s \u2013 N\u00f6v\u00e9nyek megold\u00e1sa (nem teljes)<\/span><span class=\"meta-nav\">&rarr;<\/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":[93],"tags":[51,22,86,20,28],"class_list":["post-1577","post","type-post","status-publish","format-standard","hentry","category-komplex-feladatok-megoldasai","tag-alap-algoritmus","tag-fajlkezeles","tag-java","tag-objektum","tag-rendezes"],"_links":{"self":[{"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts\/1577","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=1577"}],"version-history":[{"count":9,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts\/1577\/revisions"}],"predecessor-version":[{"id":1619,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts\/1577\/revisions\/1619"}],"wp:attachment":[{"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1577"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1577"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1577"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}