From 7026899048f45ef05a434243f8720d4ebb3256ce Mon Sep 17 00:00:00 2001 From: FedorSur Date: Thu, 19 Mar 2020 14:00:00 +0300 Subject: [PATCH] homework #2 done homework #2 done --- .idea/misc.xml | 3 +- .idea/vcs.xml | 6 ++ src/lesson2/Cycles.java | 142 +++++++++++++++++++++++++++++++++++++++- 3 files changed, 148 insertions(+), 3 deletions(-) create mode 100644 .idea/vcs.xml diff --git a/.idea/misc.xml b/.idea/misc.xml index 049adb9..e0844bc 100644 --- a/.idea/misc.xml +++ b/.idea/misc.xml @@ -1,7 +1,6 @@ - + \ No newline at end of file diff --git a/.idea/vcs.xml b/.idea/vcs.xml new file mode 100644 index 0000000..35eb1dd --- /dev/null +++ b/.idea/vcs.xml @@ -0,0 +1,6 @@ + + + + + + \ No newline at end of file diff --git a/src/lesson2/Cycles.java b/src/lesson2/Cycles.java index be4dc91..2032906 100644 --- a/src/lesson2/Cycles.java +++ b/src/lesson2/Cycles.java @@ -122,9 +122,126 @@ public static void print3Min(int[] array) { System.out.println(array[2]); } + public static int[] firstTask(int[] x) { + for (int i = 0; i < x.length; i++) { + if (x[i] == 1) { + x[i] = 0; + } else { + x[i] = 1; + } + } + for (int element : x) { + System.out.print(element + " "); + } + return (x); + } + + public static int[] SecondTask(int[] x) { + int adding = 0; + for (int i = 0; i < x.length; i++) { + x[i] = adding; + adding += 3; + } + for (int element : x) { + System.out.print(element + " "); + } + return (x); + } + + public static int[] ThirdTask(int[] x) { + for (int i = 0; i < x.length; i++) { + if (x[i] < 6) { + x[i] *= 2; + } + } + for (int element : x) { + System.out.print(element + " "); + } + return (x); + } + + public static int[][] FourthTask(int[][] x) { + for (int i = 0; i < x.length; i++) { + x[i][i] = 1; + x[i][x.length - i - 1] = 1; + } + for (int i = 0; i < x.length; i++) { + for (int j = 0; j < x[i].length; j++) + System.out.print(x[i][j] + " "); + System.out.println(" "); + } + return (x); + } + + public static void FifthTask(int[] x) { + int[] minMax = new int[]{x[0], x[0]}; + for (int i = 1; i < x.length; i++) { + if (x[i] < minMax[0]) + minMax[0] = x[i]; + if (x[i] > minMax[1]) + minMax[1] = x[i]; + } + System.out.println("Минимальный элемент массива " + minMax[0]); + System.out.println("Максимальный элемент массива " + minMax[1]); + return; + } + + public static boolean SixthTask(int[] x) { + boolean check = false; + for (int i = 0; i < x.length; i++) { + if (check) { + break; + + } + int sum1 = 0; + int sum2 = 0; + for (int j = 0; j <= i; j++) { + sum1 += x[j]; + } + for (int j = i + 1; j < x.length; j++) { + sum2 += x[j]; + } + if (sum1 == sum2) { + System.out.println(sum1); + System.out.println(sum2); + check = true; + } + } + return check; + } + public static int[] SeventhTask(int[] x, int m){ + for (int i = 0; i < x.length - 1; i++) { + int y = x[i]; + if(i