From 2a9ddc36e5560b75d939f1164e6f841458e1b579 Mon Sep 17 00:00:00 2001 From: South Date: Mon, 20 Dec 2021 23:37:05 +0300 Subject: [PATCH 1/3] HomeWork 2 --- src/main/java/com/geekbrains/HomeWorkApp.java | 38 +++++++++++++++++++ 1 file changed, 38 insertions(+) diff --git a/src/main/java/com/geekbrains/HomeWorkApp.java b/src/main/java/com/geekbrains/HomeWorkApp.java index fe71ef6..74fe60a 100644 --- a/src/main/java/com/geekbrains/HomeWorkApp.java +++ b/src/main/java/com/geekbrains/HomeWorkApp.java @@ -4,4 +4,42 @@ public class HomeWorkApp { public static void main(String[] args) { } + + public static boolean isSumBetween10And20(int a, int b) { + int sum = a+b; + if (sum>10 && sum<=20) { + return true; + } + return false; + } + + public static void isPositiveOrNegativePrint(int a) { + if (a>=0) + System.out.println("Число положтельное"); + else + System.out.println("Число отрицательное"); + } + + public static boolean isPositiveOrNegativeReturn(int a) { + if (a>=0) + return false; + else + return true; + } + + public static void printStringSeveralTimes(String str, int count) { + for (int i = 0; i < count; i++) { + System.out.println(str); + } + + } + + public static boolean isLeapYear (int year) { + if ((year%4==0 && year%100!=0) || (year%400==0)) { + return true; + } + else + return false; + } + } From 703b630a79c0555d01d52fcd96e7a3c153521735 Mon Sep 17 00:00:00 2001 From: South Date: Tue, 28 Dec 2021 09:55:39 +0300 Subject: [PATCH 2/3] HomeWork 3 --- src/main/java/com/geekbrains/HomeWorkApp.java | 39 ------------------- 1 file changed, 39 deletions(-) diff --git a/src/main/java/com/geekbrains/HomeWorkApp.java b/src/main/java/com/geekbrains/HomeWorkApp.java index 74fe60a..c807229 100644 --- a/src/main/java/com/geekbrains/HomeWorkApp.java +++ b/src/main/java/com/geekbrains/HomeWorkApp.java @@ -1,45 +1,6 @@ package com.geekbrains; public class HomeWorkApp { - public static void main(String[] args) { - - } - public static boolean isSumBetween10And20(int a, int b) { - int sum = a+b; - if (sum>10 && sum<=20) { - return true; - } - return false; - } - - public static void isPositiveOrNegativePrint(int a) { - if (a>=0) - System.out.println("Число положтельное"); - else - System.out.println("Число отрицательное"); - } - - public static boolean isPositiveOrNegativeReturn(int a) { - if (a>=0) - return false; - else - return true; - } - - public static void printStringSeveralTimes(String str, int count) { - for (int i = 0; i < count; i++) { - System.out.println(str); - } - - } - - public static boolean isLeapYear (int year) { - if ((year%4==0 && year%100!=0) || (year%400==0)) { - return true; - } - else - return false; - } } From 753174ce70bc8129be8b3d29f536a299816d553a Mon Sep 17 00:00:00 2001 From: South Date: Tue, 28 Dec 2021 15:04:01 +0300 Subject: [PATCH 3/3] HomeWork 3 --- src/main/java/com/geekbrains/HomeWorkApp.java | 118 ++++++++++++++++++ 1 file changed, 118 insertions(+) diff --git a/src/main/java/com/geekbrains/HomeWorkApp.java b/src/main/java/com/geekbrains/HomeWorkApp.java index c807229..82b1962 100644 --- a/src/main/java/com/geekbrains/HomeWorkApp.java +++ b/src/main/java/com/geekbrains/HomeWorkApp.java @@ -2,5 +2,123 @@ public class HomeWorkApp { + public static void main(String[] args) { + + } + + public static void replaceNumber() { + int[] array = {1, 0, 1, 0, 1, 0, 0}; + for (int i = 0; i < array.length; i++) { + if (array[i] == 1) + array[i] = 0; + else + array[i] = 1; + } + } + + public static void createArray() { + int[] array = new int[100]; + for (int i = 0; i < array.length; i++) { + array[i] = i + 1; + } + } + + public static void less6multiply2() { + int[] array = {1, 5, 3, 2, 11, 4, 5, 2, 4, 8, 9, 1}; + for (int i = 0; i < array.length; i++) { + if (array[i] < 6) + array[i] = array[i] * 2; + } + } + + public static void fillDiagonal() { + int lengthArray = 10; + int[][] array = new int[lengthArray][lengthArray]; + for (int i = 0; i < lengthArray; i++) { + for (int j = 0; j < lengthArray; j++) { + if ((i == j) || (lengthArray - 1 - j == i)) + array[i][j] = 1; + } + } + } + + public static int[] createArray(int len, int initValue) { + int[] array = new int[len]; + for (int i = 0; i < len; i++) { + array[i] = initValue; + } + return array; + } + + public static void findMinMaxArray() { + int lengthArray = 10; + int[] array = new int[lengthArray]; + for (int i = 0; i < lengthArray; i++) { + array[i] = i; + } + + int min = array[0]; + int max = array[0]; + for (int i = 1; i < lengthArray; i++) { + if (array[i] > max) + max = array[i]; + if (array[i] < min) + min = array[i]; + } + } + + public static boolean checkBalance(int[] array) { + int[] directSumArray =new int[array.length]; + int[] reversSumArray = new int[array.length]; + + int directSum=0; + int reversSum=0; + + for (int i = 0; i =0; i--) { + reversSum = array[i] + reversSum; + reversSumArray[array.length-1-i] =reversSum; + } + + for (int i = 0; i < array.length-1; i++) { + if (directSumArray[i] == reversSumArray[array.length - 2 - i]) + return true; + } + + return false; + } + + public static void offsetElementsOfArray(int[] array, int n) { + + if (n>0) { + for (int i = 0; i < Math.abs(n); i++) { + int temp = array[0]; + + for (int j = 1; j < array.length; j++) { + array[j-1]=array[j]; + } + array[array.length-1]=temp; + } + + } else if(n<0) { + for (int i = 0; i < Math.abs(n); i++) { + int temp = array[array.length-1]; + + for (int j = array.length-2; j >=0; j--) { + array[j+1]=array[j]; + } + array[0]=temp; + } + + } + + + } + + }