{"id":993,"date":"2015-03-20T13:50:57","date_gmt":"2015-03-20T12:50:57","guid":{"rendered":"http:\/\/www.webotlet.hu\/?p=993"},"modified":"2024-09-01T12:15:49","modified_gmt":"2024-09-01T10:15:49","slug":"java-feladatok-tombok","status":"publish","type":"post","link":"https:\/\/www.webotlet.hu\/?p=993","title":{"rendered":"Programoz\u00e1s feladatok – t\u00f6mb\u00f6k alapjai megold\u00e1sokkal"},"content":{"rendered":"
    \n
  1. T\u00f6lts fel egy 10 elem\u0171 t\u00f6mb\u00f6t a [0;100] intervallumb\u00f3l. \u00cdrd ki a t\u00f6mb els\u0151 5 elem\u00e9t!
    \n
    \nMegold\u00e1s<\/span><\/summary>\n
    \r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_tombok01;\r\n\r\npublic class Webotlet_tombok01\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n    int[] tomb = new int[10];\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      tomb[i] = (int)(Math.random() * 101);\r\n    }\r\n    \r\n    for( int i = 0; i < 5; i++ )\r\n    {\r\n      System.out.print(tomb[i] + " ");\r\n    }\r\n    System.out.println();\r\n  }\r\n  \r\n}\r\n<\/pre>\n<\/details>\n<\/li>\n
  2. T\u00f6lts fel egy 10 elem\u0171 t\u00f6mb\u00f6t a [0;100] intervallumb\u00f3l. \u00cdrd ki a t\u00f6mb utols\u00f3 5 elem\u00e9t!
    \n
    \nMegold\u00e1s<\/span><\/summary>\n
    \r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_tombok02;\r\n\r\npublic class Webotlet_tombok02\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n    int[] tomb = new int[10];\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      tomb[i] = (int)(Math.random() * 101);\r\n    }\r\n    \r\n    for( int i = 5; i < tomb.length; i++ )\r\n    {\r\n      System.out.print(tomb[i] + " ");\r\n    }\r\n    System.out.println();\r\n  }\r\n  \r\n}\r\n<\/pre>\n<\/details>\n<\/li>\n
  3. T\u00f6lts fel egy 10 elem\u0171 t\u00f6mb\u00f6t a [0;100] intervallumb\u00f3l. \u00cdrd ki a t\u00f6mb az els\u0151 \u00e9s utols\u00f3 elem \u00f6sszeg\u00e9t!
    \n
    \nMegold\u00e1s<\/span><\/summary>\n
    \r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_tombok03;\r\n\r\npublic class Webotlet_tombok03\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n    int[] tomb = new int[10];\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      tomb[i] = (int)(Math.random() * 101);\r\n    }\r\n    \r\n    System.out.println(tomb[0] + tomb[tomb.length - 1]);\r\n  }\r\n  \r\n}\r\n<\/pre>\n<\/details>\n<\/li>\n
  4. T\u00f6lts fel egy 10 elem\u0171 t\u00f6mb\u00f6t a [0;100] intervallumb\u00f3l. \u00cdrd ki a t\u00f6mb elemeit ford\u00edtott sorrendben!
    \n
    \nMegold\u00e1s<\/span><\/summary>\n
    \r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_tombok04;\r\n\r\npublic class Webotlet_tombok04\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n    int[] tomb = new int[10];\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      tomb[i] = (int)(Math.random() * 101);\r\n    }\r\n    \r\n    for( int i = tomb.length - 1; i >= 0; i-- )\r\n    {\r\n      System.out.print(tomb[i] + " ");\r\n    }\r\n    System.out.println();\r\n  }\r\n  \r\n}\r\n<\/pre>\n<\/details>\n<\/li>\n
  5. T\u00f6lts fel egy 10 elem\u0171 t\u00f6mb\u00f6t a [0;100] intervallumb\u00f3l. \u00cdrd ki, h\u00e1ny olyan sz\u00e1m van a t\u00f6mbben, melyet egy t\u0151le nagyobb sz\u00e1m k\u00f6vet!
    \n
    \nMegold\u00e1s<\/span><\/summary>\n
    \r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_tombok05;\r\n\r\npublic class Webotlet_tombok05\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n    int[] tomb = new int[10];\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      tomb[i] = (int)(Math.random() * 101);\r\n    }\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      System.out.print(tomb[i] + " ");\r\n    }\r\n    System.out.println();\r\n\r\n    int db = 0;\r\n    for( int i = 0; i < tomb.length - 1; i++ )\r\n    {\r\n      if( tomb[i] < tomb[i + 1] )\r\n      {\r\n        db++;\r\n      }\r\n    }\r\n    System.out.println(db);\r\n  }\r\n  \r\n}\r\n<\/pre>\n<\/details>\n<\/li>\n
  6. T\u00f6lts fel egy 10 elem\u0171 t\u00f6mb\u00f6t a [0;20] intervallumb\u00f3l. \u00cdrd ki, van-e a t\u00f6mbben egym\u00e1s mellett k\u00e9t egyforma sz\u00e1m!
    \n
    \nMegold\u00e1s<\/span><\/summary>\n
    \r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_tombok06;\r\n\r\npublic class Webotlet_tombok06\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n    int[] tomb = new int[10];\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      tomb[i] = (int)(Math.random() * 21);\r\n    }\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      System.out.print(tomb[i] + " ");\r\n    }\r\n    System.out.println();\r\n\r\n    boolean van = false;\r\n    for( int i = 0; i < tomb.length - 1; i++ )\r\n    {\r\n      if( tomb[i] == tomb[i + 1] )\r\n      {\r\n        van = true;\r\n        break;\r\n      }\r\n    }\r\n    \r\n    if( van )\r\n    {\r\n      System.out.println("Van egymas mellett egyforma szam.");\r\n    }\r\n    else\r\n    {\r\n      System.out.println("Nincs egymas mellett egyforma szam.");\r\n    }\r\n  }\r\n  \r\n}\r\n<\/pre>\n<\/details>\n<\/li>\n
  7. T\u00f6lts fel egy 20 elem\u0171 t\u00f6mb\u00f6t a [0;10] intervallumb\u00f3l. \u00cdrd ki, van-e a t\u00f6mbben egym\u00e1s mellett h\u00e1rom egyforma sz\u00e1m!
    \n
    \nMegold\u00e1s<\/span><\/summary>\n
    \r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_tombok07;\r\n\r\npublic class Webotlet_tombok07\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n    int[] tomb = new int[10];\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      tomb[i] = (int)(Math.random() * 11);\r\n    }\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      System.out.print(tomb[i] + " ");\r\n    }\r\n    System.out.println();\r\n\r\n    boolean van = false;\r\n    for( int i = 0; i < tomb.length - 2; i++ )\r\n    {\r\n      if( tomb[i] == tomb[i + 1] && tomb[i] == tomb[i + 2] )\r\n      {\r\n        van = true;\r\n        break;\r\n      }\r\n    }\r\n    \r\n    if( van )\r\n    {\r\n      System.out.println("Van egymas mellett 3 egyforma szam.");\r\n    }\r\n    else\r\n    {\r\n      System.out.println("Nincs egymas mellett 3 egyforma szam.");\r\n    }\r\n  }\r\n  \r\n}\r\n<\/pre>\n<\/details>\n<\/li>\n
  8. T\u00f6lts fel egy 10 elem\u0171 t\u00f6mb\u00f6t a [0;20] intervallumb\u00f3l. \u00cdrd ki, van-e olyan sz\u00e1m, mely az el\u0151tte l\u00e9v\u0151 sz\u00e1m k\u00e9tszerese!
    \n
    \nMegold\u00e1s<\/span><\/summary>\n
    \r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_tombok08;\r\n\r\npublic class Webotlet_tombok08\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n    int[] tomb = new int[10];\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      tomb[i] = (int)(Math.random() * 21);\r\n    }\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      System.out.print(tomb[i] + " ");\r\n    }\r\n    System.out.println();\r\n\r\n    boolean van = false;\r\n    for( int i = 0; i < tomb.length - 1; i++ )\r\n    {\r\n      if( tomb[i] * 2 == tomb[i + 1] )\r\n      {\r\n        van = true;\r\n        break;\r\n      }\r\n    }\r\n    \r\n    if( van )\r\n    {\r\n      System.out.println("Van olyan szam, ami az elotte "\r\n        + "levo ketszerese.");\r\n    }\r\n    else\r\n    {\r\n      System.out.println("Nincs olyan szam, ami az elotte "\r\n        + "levo ketszerese.");\r\n    }\r\n  }\r\n  \r\n}\r\n<\/pre>\n<\/details>\n<\/li>\n
  9. T\u00f6lts fel egy 5 elem\u0171 t\u00f6mb\u00f6t a [0;1000] intervallumb\u00f3l. Vizsg\u00e1ld meg, hogy a t\u00f6mb elemei n\u00f6vekv\u0151 sorrendben \u00e1llnak-e, \u00e9s \u00edrd ki az eredm\u00e9nyt!
    \n
    \nMegold\u00e1s<\/span><\/summary>\n
    \r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_tombok09;\r\n\r\npublic class Webotlet_tombok09\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n    int[] tomb = new int[5];\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      tomb[i] = (int)(Math.random() * 1001);\r\n    }\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      System.out.print(tomb[i] + " ");\r\n    }\r\n    System.out.println();\r\n\r\n    boolean novekvo = true;\r\n    for( int i = 0; i < tomb.length - 1; i++ )\r\n    {\r\n      if( tomb[i] >= tomb[i + 1] )\r\n      {\r\n        novekvo = false;\r\n        break;\r\n      }\r\n    }\r\n    \r\n    if( novekvo )\r\n    {\r\n      System.out.println("Novekvo sorrendben allnak.");\r\n    }\r\n    else\r\n    {\r\n      System.out.println("Nem allnak novekvo sorrendben.");\r\n    }\r\n  }\r\n  \r\n}\r\n<\/pre>\n<\/details>\n<\/li>\n
  10. T\u00f6lts fel egy 10 elem\u0171 t\u00f6mb\u00f6t a [0;20] intervallumb\u00f3l. \u00cdrd ki azokat a sz\u00e1mokat, mely a k\u00e9t szomsz\u00e9dj\u00e1nak az \u00f6sszege!
    \n
    \nMegold\u00e1s<\/span><\/summary>\n
    \r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_tombok10;\r\n\r\npublic class Webotlet_tombok10\r\n{\r\n  public static void main(String[] args)\r\n  {\r\n    int[] tomb = new int[10];\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      tomb[i] = (int)(Math.random() * 21);\r\n    }\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      System.out.print(tomb[i] + " ");\r\n    }\r\n    System.out.println();\r\n\r\n    for( int i = 1; i < tomb.length - 1; i++ )\r\n    {\r\n      if( tomb[i] == tomb[i - 1] + tomb[i + 1])\r\n      {\r\n        System.out.print(tomb[i]);\r\n      }\r\n    }\r\n    System.out.println();\r\n  }\r\n  \r\n}\r\n<\/pre>\n<\/details>\n<\/li>\n
  11. T\u00f6lts fel egy 5 elem\u0171 t\u00f6mb\u00f6t a [0;5] intervallumb\u00f3l. Vizsg\u00e1ld meg, hogy a t\u00f6mb\u00f6t el\u00f6lr\u0151l \u00e9s h\u00e1tulr\u00f3l olvasva ugyanazt a sz\u00e1msort kapjuk-e!
    \n
    \nMegold\u00e1s<\/span><\/summary>\n
    \r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_tombok11;\r\n\r\npublic class Webotlet_tombok11\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n    int[] tomb = new int[5];\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      tomb[i] = (int)(Math.random() * 6);\r\n    }\r\n    \r\n    \/\/teszteleshez\r\n\/\/    tomb = new int[]{1,2,3,2,1};\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      System.out.print(tomb[i] + " ");\r\n    }\r\n    System.out.println();\r\n\r\n    boolean ugyanaz = true;\r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      if( tomb[i] != tomb[tomb.length - 1 - i] )\r\n      {\r\n        ugyanaz = false;\r\n        break;\r\n      }\r\n    }\r\n    \r\n    if( ugyanaz )\r\n    {\r\n      System.out.println("A tomb ugyanaz az elejerol es "\r\n        + "a vegerol olvasva.");\r\n    }\r\n    else\r\n    {\r\n      System.out.println("A tomb nem ugyanaz az elejerol "\r\n        + "es a vegerol olvasva.");\r\n    }\r\n  }\r\n  \r\n}\r\n<\/pre>\n<\/details>\n<\/li>\n
  12. T\u00f6lts fel egy 10 elem\u0171 t\u00f6mb\u00f6t a [0;20] intervallumb\u00f3l. Sorsolj ki egy N sz\u00e1mot az [1;5] intervallumb\u00f3l. \u00cdrd ki a t\u00f6mb elej\u00e9n \u00e9s v\u00e9g\u00e9n l\u00e9v\u0151 N elemet egym\u00e1s mell\u00e9! P\u00e9ld\u00e1k:
    \n{ 0,3,2,1,2,2,4,8,3,6 }, 3 -> { 0,3,2,8,3,6 }
    \n{ 0,3,2,1,2,2,4,8,3,6 }, 2 -> { 0,3,3,6 }<\/p>\n
    \n1. megold\u00e1s<\/span><\/summary>\n
    \r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_tombok12;\r\n\r\npublic class Webotlet_tombok12\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n    int[] tomb = new int[10];\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      tomb[i] = (int)(Math.random() * 21);\r\n    }\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      System.out.print(tomb[i] + " ");\r\n    }\r\n    System.out.println();\r\n    \r\n    int limit = (int)(Math.random() * 5) + 1;\r\n    System.out.println("limit: " + limit);\r\n    \r\n    for( int i = 0; i < limit; i++ )\r\n    {\r\n      System.out.print(tomb[i] + " ");\r\n    }\r\n    \r\n    for( int i = tomb.length-limit; i < tomb.length; i++ )\r\n    {\r\n      System.out.print(tomb[i] + " ");\r\n    }\r\n    System.out.println();\r\n  }\r\n  \r\n}\r\n<\/pre>\n<\/details>\n
    \n2. megold\u00e1s<\/span><\/summary>\n
    \r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_tombok12v2;\r\n\r\npublic class Webotlet_tombok12v2\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n    int[] tomb = new int[10];\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      tomb[i] = (int)(Math.random() * 21);\r\n    }\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      System.out.print(tomb[i] + " ");\r\n    }\r\n    System.out.println();\r\n    \r\n    int limit = (int)(Math.random() * 5) + 1;\r\n    System.out.println("limit: " + limit);\r\n    \r\n    for( int i = 0; i < limit; i++ )\r\n    {\r\n      System.out.print(tomb[i] + " ");\r\n    }\r\n     \r\n    for( int i = 0; i < limit; i++ )\r\n    {\r\n      System.out.print(tomb[tomb.length - limit + i] + " ");\r\n    }\r\n  }\r\n  \r\n}\r\n<\/pre>\n<\/details>\n
    \n3. megold\u00e1s<\/span><\/summary>\n
    \r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_tombok12v3;\r\n\r\npublic class Webotlet_tombok12v3\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n    int[] tomb = new int[10];\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      tomb[i] = (int)(Math.random() * 21);\r\n    }\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      System.out.print(tomb[i] + " ");\r\n    }\r\n    System.out.println();\r\n    \r\n    int limit = (int)(Math.random() * 5) + 1;\r\n    System.out.println("limit: " + limit);\r\n    \r\n    for( int i = 0; i < limit * 2; i++ )\r\n    {\r\n      if( i < limit )\r\n      {\r\n        System.out.print(tomb[i] + " ");\r\n      }\r\n      else\r\n      {\r\n        System.out.print(tomb[tomb.length - limit * 2 + i] + " ");\r\n      }\r\n      \r\n    }\r\n  }\r\n  \r\n}\r\n<\/pre>\n<\/details>\n<\/li>\n
  13. T\u00f6lts fel egy 10 elem\u0171 t\u00f6mb\u00f6t a [0;20] intervallumb\u00f3l. Sorsolj ki egy N sz\u00e1mot az [1;5] intervallumb\u00f3l. \u00cdrd ki a t\u00f6mb elej\u00e9n \u00e9s v\u00e9g\u00e9n l\u00e9v\u0151 N elemet egym\u00e1s mell\u00e9 \u00fagy, hogy a ki\u00edrat\u00e1st mindig a t\u00f6mb sz\u00e9l\u00e9t\u0151l kezded! P\u00e9ld\u00e1k:
    \n{ 0,3,2,1,2,2,4,8,3,6 }, 3 -> { 0,3,2,6,3,8 }
    \n{ 0,3,2,1,2,2,4,8,3,6 }, 4 -> { 0,3,2,1,6,3,8,4 }<\/p>\n
    \n1. megold\u00e1s<\/span><\/summary>\n
    \r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_tombok13;\r\n\r\npublic class Webotlet_tombok13\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n    int[] tomb = new int[10];\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      tomb[i] = (int)(Math.random() * 21);\r\n    }\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      System.out.print(tomb[i] + " ");\r\n    }\r\n    System.out.println();\r\n    \r\n    int limit = (int)(Math.random() * 5) + 1;\r\n    System.out.println("limit: " + limit);\r\n    \r\n    for( int i = 0; i < limit; i++ )\r\n    {\r\n      System.out.print(tomb[i] + " ");\r\n    }\r\n    \r\n    for( int i = tomb.length - 1; i >= tomb.length - limit; i-- )\r\n    {\r\n      System.out.print(tomb[i] + " ");\r\n    }\r\n    System.out.println();\r\n  }\r\n  \r\n}\r\n<\/pre>\n<\/details>\n
    \n2. megold\u00e1s<\/span><\/summary>\n
    \r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_tombok13v2;\r\n\r\npublic class Webotlet_tombok13v2\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n    int[] tomb = new int[10];\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      tomb[i] = (int)(Math.random() * 21);\r\n    }\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      System.out.print(tomb[i] + " ");\r\n    }\r\n    System.out.println();\r\n    \r\n    int limit = (int)(Math.random() * 5) + 1;\r\n    System.out.println("limit: " + limit);\r\n    \r\n    for( int i = 0; i < limit; i++ )\r\n    {\r\n      System.out.print(tomb[i] + " ");\r\n    }\r\n    \r\n    for( int i = 0; i < limit; i++ )\r\n    {\r\n      System.out.print(tomb[tomb.length - 1 - i]+" ");\r\n    }\r\n    System.out.println();\r\n  }\r\n  \r\n}\r\n<\/pre>\n<\/details>\n
    \n3. megold\u00e1s<\/span><\/summary>\n
    \r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_tombok13v3;\r\n\r\npublic class Webotlet_tombok13v3\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n    int[] tomb = new int[10];\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      tomb[i] = (int)(Math.random() * 21);\r\n    }\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      System.out.print(tomb[i] + " ");\r\n    }\r\n    System.out.println();\r\n    \r\n    int limit = (int)(Math.random() * 5) + 1;\r\n    System.out.println("limit: " + limit);\r\n    \r\n    for( int i = 0; i < limit * 2; i++ )\r\n    {\r\n      if( i < limit )\r\n      {\r\n        System.out.print(tomb[i] + " ");\r\n      }\r\n      else\r\n      {\r\n        System.out.print(tomb[tomb.length - 1 + limit - i]+" ");\r\n      }\r\n    }\r\n    System.out.println();\r\n  }\r\n  \r\n}\r\n<\/pre>\n<\/details>\n<\/li>\n
  14. T\u00f6lts fel egy 10 elem\u0171 t\u00f6mb\u00f6t a [0;20] intervallumb\u00f3l. Sorsolj ki egy pozit\u00edv p\u00e1ros sz\u00e1mot, ami legfeljebb a t\u00f6mbm\u00e9ret lehet. \u00cdrd ki a t\u00f6mb k\u00f6z\u00e9ps\u0151 N elem\u00e9t.
    \nP\u00e9ld\u00e1k:
    \n{ 7,1,20,1,17,3,9,4,19,9 }, N: 2 -> {17,3}
    \n{ 7,1,20,1,17,3,9,4,19,9 }, N: 6 -> {20,1,17,3,9,4}
    \n{ 7,1,20,1,17,3,9,4,19,9 }, N: 4 -> {1,17,3,9}<\/p>\n
    \nMegold\u00e1s<\/span><\/summary>\n
    \r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_tombok14;\r\n\r\npublic class Webotlet_tombok14\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n    int[] tomb = new int[10];\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      tomb[i] = (int)(Math.random() * 21);\r\n    }\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      System.out.print(tomb[i] + " ");\r\n    }\r\n    System.out.println();\r\n    \r\n    int n;\r\n    do\r\n    {\r\n      n = (int)(Math.random() * 8) + 2;\r\n    }\r\n    while( n % 2 != 0 );\r\n    \r\n    System.out.println("N: " + n);\r\n\r\n    int push = 5 - (n \/ 2);\r\n    for( int i = 0; i < n; i++ )\r\n    {\r\n      System.out.print(tomb[i + push] + " ");\r\n    }\r\n    System.out.println();\r\n  }\r\n  \r\n}\r\n<\/pre>\n<\/details>\n<\/li>\n
  15. T\u00f6lts fel egy t\u00f6mb\u00f6t a [0;20] intervallumb\u00f3l. K\u00e9t r\u00e9szre v\u00e1ghat\u00f3-e a t\u00f6mb valahol \u00fagy, hogy a k\u00e9t r\u00e9szben l\u00e9v\u0151 sz\u00e1mok \u00f6sszege egyenl\u0151? P\u00e9ld\u00e1k:
    \n{ 0,3,2,1,4 } -> igen {0,3,2} {1,4}
    \n{ 2,1,1,0 } -> igen { 2 } { 1,1,0 }
    \n{ 0,3,2,1,5 } -> nem<\/p>\n
    \nMegold\u00e1s<\/span><\/summary>\n
    \r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_tombok15;\r\n\r\npublic class Webotlet_tombok15\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n    \/\/ v\u00e9letlen m\u00e9ret\u0171 t\u00f6mb\r\n    int meret = (int)(Math.random() * 9) + 2;\r\n    int[] tomb = new int[meret];\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      tomb[i] = (int)(Math.random() * 21);\r\n    }\r\n    \r\n    \/\/ tesztelni\r\n    \/\/ tomb = new int[] {0,3,2,1,4};\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      System.out.print(tomb[i] + " ");\r\n    }\r\n    System.out.println();\r\n    \r\n    int osszeg = 0;\r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      osszeg += tomb[i];\r\n    }\r\n    \r\n    double fele = osszeg \/ 2.0;\r\n    \r\n    int reszOsszeg = 0;\r\n    boolean oszthato = false;\r\n    int limit = 0; \/\/ csak a tombok kiirasahoz kell\r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      reszOsszeg += tomb[i];\r\n      if( reszOsszeg == fele )\r\n      {\r\n        oszthato = true;\r\n        limit = i;\r\n        break;\r\n      }\r\n    }\r\n    \r\n    if( oszthato )\r\n    {\r\n      System.out.println("igen");\r\n      \/\/ kiirom a ket tombot\r\n      \/\/ szebben is lehetne, de csak ellenorzeskepp kell :)\r\n      System.out.print("{");\r\n      for( int i = 0; i < tomb.length - 1; i++ )\r\n      {\r\n        if( i < limit )\r\n        {\r\n          System.out.print(tomb[i]+ ",");\r\n        }\r\n        else if( i == limit )\r\n        {\r\n          System.out.print(tomb[i] + "} {");\r\n        }\r\n        else\r\n        {\r\n          System.out.print(tomb[i] + ",");\r\n        }\r\n      }\r\n      System.out.println(tomb[tomb.length - 1] + "}");\r\n    }\r\n    else\r\n    {\r\n      System.out.println("nem");\r\n    }\r\n  }\r\n  \r\n}\r\n<\/pre>\n<\/details>\n<\/li>\n
  16. T\u00f6lts fel egy 10 elem\u0171 t\u00f6mb\u00f6t a [-30;100] intervallumb\u00f3l sorsolt p\u00e1ratlan sz\u00e1mokkal!
    \n
    \nMegold\u00e1s<\/span><\/summary>\n
    \r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\n\r\npackage webotlet_tombok16;\r\n\r\npublic class Webotlet_Tombok16\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n    int[] tomb = new int[10];\r\n    \r\n    int cel = 0; \/\/ ennyi sz\u00e1m van m\u00e1r meg\r\n    int idx = 0; \/\/ a k\u00f6vetkez\u0151 \u00fcres hely a t\u00f6mbben\r\n    while( cel != 10 )\r\n    {\r\n      int szam = (int)(Math.random()*131)-30;\r\n      if( szam % 2 != 0 )\r\n      {\r\n        tomb[idx] = szam;\r\n        idx++;\r\n        cel++;\r\n      }\r\n    }\r\n    \r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      System.out.print(tomb[i]+" ");\r\n    }\r\n    System.out.println();\r\n  }\r\n  \r\n}\r\n<\/pre>\n<\/details>\n<\/li>\n
  17. Sorsold ki az \u00f6t\u00f6s lott\u00f3 nyer\u0151sz\u00e1mait! (5 sz\u00e1m a [1;90] intervallumb\u00f3l)
    \n
    \n1. megold\u00e1s<\/span><\/summary>\n
    \r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_tombok17;\r\n\r\npublic class Webotlet_Tombok17\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n    int[] sorsolt = new int[5];\r\n    \r\n    int cel = 0; \/\/ ennyi sz\u00e1m van m\u00e1r meg\r\n    int idx = 0; \/\/ a k\u00f6vetkez\u0151 \u00fcres hely a t\u00f6mbben\r\n    \r\n    while( cel != 5 )\r\n    {\r\n      int szam = (int)(Math.random()*90)+1;\r\n      \r\n      boolean benne = false;\r\n      for( int i = 0; i < cel; i++ )\r\n      {\r\n        if( sorsolt[i] == szam )\r\n        {\r\n          benne = true;\r\n          break;\r\n        }\r\n      }\r\n      \r\n      if( !benne )\r\n      {\r\n        sorsolt[idx] = szam;\r\n        idx++;\r\n        cel++;\r\n      }\r\n    }\r\n        \r\n    for( int i = 0; i < sorsolt.length; i++ )\r\n    {\r\n      System.out.print(sorsolt[i]+" ");\r\n    }\r\n    System.out.println();\r\n  }\r\n  \r\n}\r\n<\/pre>\n<\/details>\n
    \n2. megold\u00e1s<\/span><\/summary>\n
    \r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_tombok17v2;\r\n\r\npublic class Webotlet_Tombok17v2\r\n{\r\n    \r\n  public static void main(String[] args)\r\n  {\r\n    int[] szamok = new int[91]; \/\/ miket sorsoltunk eddig\r\n    int[] sorsolt = new int[5];\r\n    \r\n    int cel = 0; \/\/ ennyi sz\u00e1m van m\u00e1r meg\r\n    int idx = 0; \/\/ a k\u00f6vetkez\u0151 \u00fcres hely a t\u00f6mbben\r\n    \r\n    while( cel != 5 )\r\n    {\r\n      int szam = (int)(Math.random()*90)+1;\r\n      \r\n      if( szamok[szam] == 0 )\r\n      {\r\n        szamok[szam] = szam;\r\n\r\n        sorsolt[idx] = szam;\r\n        idx++;\r\n        cel++;\r\n      }\r\n    }\r\n    \r\n    for( int i = 0; i < sorsolt.length; i++ )\r\n    {\r\n      System.out.print(sorsolt[i]+" ");\r\n    }\r\n    System.out.println();\r\n  }\r\n  \r\n}\r\n<\/pre>\n<\/details>\n<\/li>\n
  18. Vizsg\u00e1ld meg, hogy egy t\u00f6mb elej\u00e9n \u00e9s v\u00e9g\u00e9n ugyanazok a sz\u00e1mok \u00e1llnak-e azonos sorrendben. \u00cdrd ki, hogy melyek ezek a sz\u00e1mok! Ha t\u00f6bb ilyen van, akkor a leghosszabb ilyen sz\u00e1msort \u00edrd ki! P\u00e9ld\u00e1k:
    \n{ 0,2,5,7,3,0,2,5 } -> igen { 0,2,5 }
    \n{ 2,4,7,4,2,4 } -> igen { 2,4 }
    \n{ 2,4,7,4,2,2 } -> igen { 2 }
    \n{ 0,2,5,7,2,5,2 } -> nem<\/p>\n
    \nMegold\u00e1s<\/span><\/summary>\n
    \r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_tombok18;\r\n\r\npublic class Webotlet_tombok18\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n    int[] tomb = new int[] { 0, 2, 5, 7, 3, 0, 2, 5 };\r\n\/\/    int[] tomb = new int[] { 2,4,7,4,2,4 };\r\n\/\/    int[] tomb = new int[] { 2,4,7,4,2,2 };\r\n\/\/    int[] tomb = new int[] { 2,4,7,2,4,7 };\r\n\/\/    int[] tomb = new int[] { 0,2,5,7,2,5,2 };\r\n\/\/    int[] tomb = new int[] { 2,2,2,2,2 };\r\n\r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      System.out.print(tomb[i] + " ");\r\n    }\r\n    System.out.println();\r\n\r\n    int limit = 1;\r\n    int maxDb = 0;\r\n    for( int i = 0; i < tomb.length \/ 2; i++ )\r\n    {\r\n      int talalat = 0;\r\n\r\n      for( int j = 0; j < limit; j++ )\r\n      {\r\n        if( tomb[j] == tomb[tomb.length - limit + j] )\r\n        {\r\n          talalat++;\r\n        }\r\n        else\r\n        {\r\n          break;\r\n        }\r\n      }\r\n      if( talalat > maxDb )\r\n      {\r\n        maxDb = talalat;\r\n      }\r\n      limit++;\r\n    }\r\n    \r\n    if( maxDb == 0 )\r\n    {\r\n      System.out.println("Nincsenek egyforma szamok a tomb szelein.");\r\n    }\r\n    else\r\n    {\r\n      for( int i = 0; i < maxDb; i++ )\r\n      {\r\n        System.out.print(tomb[i] + " ");\r\n      }\r\n    }\r\n  }\r\n\r\n}\r\n<\/pre>\n<\/details>\n<\/li>\n
  19. Vizsg\u00e1ld meg, hogy egy t\u00f6mb elej\u00e9n \u00e9s v\u00e9g\u00e9n ugyanazok a sz\u00e1mok \u00e1llnak-e \u00fagy, hogy a sz\u00e1mokat a t\u00f6mb sz\u00e9l\u00e9t\u0151l kezdj\u00fck beolvasni. \u00cdrd ki, hogy melyek ezek a sz\u00e1mok! P\u00e9ld\u00e1k:
    \n{ 0,2,5,7,3,5,2,0 } -> igen { 5,2,0 }
    \n{ 2,4,7,4,2,2 } -> igen { 2 }
    \n{ 0,2,5,7,2,5,2 } -> nem<\/p>\n
    \nMegold\u00e1s<\/span><\/summary>\n
    \r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_tombok19;\r\n\r\npublic class Webotlet_tombok19\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n\/\/    int[] tomb = new int[] { 0,2,5,7,3,5,2,0 };\r\n\/\/    int[] tomb = new int[] { 2,4,7,4,2,2 };\r\n    int[] tomb = new int[] { 0,2,5,7,2,5,2 };\r\n\r\n    for( int i = 0; i < tomb.length; i++ )\r\n    {\r\n      System.out.print(tomb[i] + " ");\r\n    }\r\n    System.out.println();\r\n\r\n    int limit = 1;\r\n    int maxDb = 0;\r\n    for( int i = 0; i < tomb.length \/ 2; i++ )\r\n    {\r\n      int talalat = 0;\r\n\r\n      for( int j = 0; j < limit; j++ )\r\n      {\r\n        if( tomb[j] == tomb[tomb.length -1 - j] )\r\n        {\r\n          talalat++;\r\n        }\r\n        else\r\n        {\r\n          break;\r\n        }\r\n      }\r\n      if( talalat > maxDb )\r\n      {\r\n        maxDb = talalat;\r\n      }\r\n      limit++;\r\n    }\r\n    \r\n    if( maxDb == 0 )\r\n    {\r\n      System.out.println("Nincsenek egyforma szamok a tomb szelein.");\r\n    }\r\n    else\r\n    {\r\n      for( int i = 0; i < maxDb; i++ )\r\n      {\r\n        System.out.print(tomb[i] + " ");\r\n      }\r\n    }\r\n  }\r\n\r\n}\r\n<\/pre>\n<\/details>\n<\/li>\n
  20. T\u00f6lts fel egy 20 elem\u0171 t\u00f6mb\u00f6t a [0;5] intervallumb\u00f3l. \u00cdrd ki, hogy melyik sz\u00e1m szerepel benne a legt\u00f6bbsz\u00f6r egym\u00e1s mellett! Ha t\u00f6bb ilyen van, az els\u0151t \u00edrd ki. P\u00e9ld\u00e1k:
    \n{ 4,0,3,1,5,2,4,4,1,1,2,5,2,1,1,1,1,4,2,1} -> 1
    \n{ 1,2,0,4,4,1,5,0,4,4,4,0,3,4,3,3,3,5,0,4} -> 4<\/p>\n
    \nMegold\u00e1s<\/span><\/summary>\n
    \r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_tombok20;\r\n\r\npublic class Webotlet_tombok20\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n    int[] tomb = {4,0,3,1,5,2,4,4,1,1,2,5,2,1,1,1,1,4,2,1};\r\n\/\/    int[] tomb = { 1,2,0,4,4,1,5,0,4,4,4,0,3,4,3,3,3,2,0,4};\r\n\r\n    int db = 1;\r\n    int maxdb = db;\r\n    int maxmi = tomb[0];\r\n    for( int i = 1; i < tomb.length; i++ )\r\n    {\r\n      if( tomb[i] == tomb[i - 1] )\r\n      {\r\n        db++;\r\n        if( db > maxdb )\r\n        {\r\n          maxdb = db;\r\n          maxmi = tomb[i];\r\n        }\r\n      }\r\n      else\r\n      {\r\n        db = 1;\r\n      }\r\n    }\r\n    System.out.println(maxmi);\r\n  }\r\n}\r\n<\/pre>\n<\/details>\n<\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":"
    T\u00f6lts fel egy 10 elem\u0171 t\u00f6mb\u00f6t a [0;100] intervallumb\u00f3l. \u00cdrd ki a t\u00f6mb els\u0151 5 elem\u00e9t! Megold\u00e1s \/** * * @author https:\/\/webotlet.hu *\/ package webotlet_tombok01; public class Webotlet_tombok01 { public static void main(String[] args) { int[] tomb = new int[10]; Tov\u00e1bb   Programoz\u00e1s feladatok – t\u00f6mb\u00f6k alapjai megold\u00e1sokkal<\/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":[40],"tags":[31,144,143,15],"class_list":["post-993","post","type-post","status-publish","format-standard","hentry","category-altalanos-feladatok","tag-ciklus","tag-java_programozas","tag-programozas","tag-tomb"],"_links":{"self":[{"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts\/993","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=993"}],"version-history":[{"count":28,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts\/993\/revisions"}],"predecessor-version":[{"id":3167,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts\/993\/revisions\/3167"}],"wp:attachment":[{"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=993"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=993"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=993"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}