{"id":1527,"date":"2015-06-02T11:52:52","date_gmt":"2015-06-02T09:52:52","guid":{"rendered":"http:\/\/www.webotlet.hu\/?p=1527"},"modified":"2015-06-03T21:22:20","modified_gmt":"2015-06-03T19:22:20","slug":"java-egyperces-atlok-megoldasa","status":"publish","type":"post","link":"https:\/\/www.webotlet.hu\/?p=1527","title":{"rendered":"Java egyperces – \u00c1tl\u00f3k megold\u00e1sa"},"content":{"rendered":"

Csak akkor olvass tov\u00e1bb, ha a \u00c1tl\u00f3k<\/a> feladatot megoldottad, vagy nem siker\u00fclt megoldani.<\/strong><\/h3>\n

Az alap feladatot a fenti linken megtal\u00e1lod. A megold\u00e1st \u00fagy adom meg, hogy egy meret<\/em> nev\u0171 v\u00e1ltoz\u00f3ba meg lehet adni a n\u00e9gyzet m\u00e9ret\u00e9t, amelyben meg kell keresni a legnagyobb \u00f6sszeg\u0171 \u00e1tl\u00f3t.<\/p>\n

\r\n\/**\r\n *\r\n * @author http:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_atlok;\r\n\r\npublic class Webotlet_Atlok\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n\/\/ a matrix meretenek megadasa\r\n    int meret = 10;\r\n    int[][] matrix = new int[meret][meret];\r\n\r\n\/\/ a matrix feltoltese es kiiratasa\r\n    for (int i = 0; i < matrix.length; i++)\r\n    {\r\n      for (int j = 0; j < matrix[i].length; j++)\r\n      {\r\n        matrix[i][j] = (int) (Math.random() * 100);\r\n      }\r\n    }\r\n    kiir(matrix);\r\n\r\n\/\/ itt tarolom majd a maximum osszegu atlo kezdopontjanak\r\n\/\/ koordinatait, es az osszeget  { x, y, osszeg }\r\n    int[] max = new int[3];\r\n\r\n    int osszeg = 0;\r\n\r\n\/\/ azokat az atlokat vizsgalom, ahol a kezdopont\r\n\/\/ az elso sorban van\r\n    for (int j = 0; j < matrix[0].length; j++)\r\n    {\r\n      int i = 0;\r\n\/\/ a k valtozoban tarolom, hogy hany mezovel haladtam dk-i iranyba\r\n      int k = 0;\r\n      osszeg = 0;\r\n      System.out.print("Atlo kezdopont: " + i + "," + j);\r\n      do\r\n      {\r\n        osszeg += matrix[i + k][j + k];\r\n        k++;\r\n      }\r\n      while (i + k < meret && j + k < meret);\r\n      System.out.println(" osszeg: " + osszeg);\r\n      if (osszeg > max[2])\r\n      {\r\n        max[0] = i;\r\n        max[1] = j;\r\n        max[2] = osszeg;\r\n      }\r\n    }\r\n\r\n\/\/ azokat az atlokat vizsgalom, ahol a kezdopont\r\n\/\/ az elso oszlopban van\r\n\/\/ (a 0,0 koordinataju atlot nem szamolom ki megegyszer)\r\n    for (int i = 1; i < matrix.length; i++)\r\n    {\r\n      int j = 0;\r\n\/\/ a k valtozoban tarolom, hogy hany mezovel haladtam dk-i iranyba\r\n      int k = 0;\r\n      osszeg = 0;\r\n      System.out.print("Atlo kezdopont: " + i + "," + j);\r\n\r\n      do\r\n      {\r\n        osszeg += matrix[i + k][j + k];\r\n        k++;\r\n      }\r\n      while (i + k < meret && j + k < meret);\r\n\r\n      System.out.println(" osszeg: " + osszeg);\r\n      if (osszeg > max[2])\r\n      {\r\n        max[0] = i;\r\n        max[1] = j;\r\n        max[2] = osszeg;\r\n      }\r\n    }\r\n\r\n    System.out.println("max: " + max[2] + " helye: " + max[0] + "," + max[1]);\r\n  }\r\n\r\n  public static void kiir(int[][] tomb)\r\n  {\r\n    for (int i = 0; i < tomb.length; i++)\r\n    {\r\n      for (int j = 0; j < tomb[i].length; j++)\r\n      {\r\n        System.out.print(String.format("%3d", tomb[i][j]));\r\n      }\r\n      System.out.println();\r\n    }\r\n  }\r\n\r\n}\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"
Csak akkor olvass tov\u00e1bb, ha a \u00c1tl\u00f3k feladatot megoldottad, vagy nem siker\u00fclt megoldani. Az alap feladatot a fenti linken megtal\u00e1lod. A megold\u00e1st \u00fagy adom meg, hogy egy meret nev\u0171 v\u00e1ltoz\u00f3ba meg lehet adni a n\u00e9gyzet m\u00e9ret\u00e9t, amelyben meg kell keresni Tov\u00e1bb   Java egyperces – \u00c1tl\u00f3k megold\u00e1sa<\/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":[95],"tags":[86,120,143,65],"class_list":["post-1527","post","type-post","status-publish","format-standard","hentry","category-egyperces-feladatok-megoldasai","tag-java","tag-ketdimenzios-tomb","tag-programozas","tag-tobbdimenzios-tomb"],"_links":{"self":[{"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts\/1527","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=1527"}],"version-history":[{"count":5,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts\/1527\/revisions"}],"predecessor-version":[{"id":1536,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts\/1527\/revisions\/1536"}],"wp:attachment":[{"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1527"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1527"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1527"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}