Feature

java-basics-template.iml

@@ -0,0 +1,22 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module org.jetbrains.idea.maven.project.MavenProjectsManager.isMavenModule="true" type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" LANGUAGE_LEVEL="JDK_1_8">
+    <output url="file://$MODULE_DIR$/target/classes" />
+    <output-test url="file://$MODULE_DIR$/target/test-classes" />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src/main/java" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/src/test/java" isTestSource="true" />
+      <excludeFolder url="file://$MODULE_DIR$/target" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+    <orderEntry type="library" scope="TEST" name="Maven: org.junit.jupiter:junit-jupiter:5.5.2" level="project" />
+    <orderEntry type="library" scope="TEST" name="Maven: org.junit.jupiter:junit-jupiter-api:5.5.2" level="project" />
+    <orderEntry type="library" scope="TEST" name="Maven: org.apiguardian:apiguardian-api:1.1.0" level="project" />
+    <orderEntry type="library" scope="TEST" name="Maven: org.opentest4j:opentest4j:1.2.0" level="project" />
+    <orderEntry type="library" scope="TEST" name="Maven: org.junit.platform:junit-platform-commons:1.5.2" level="project" />
+    <orderEntry type="library" scope="TEST" name="Maven: org.junit.jupiter:junit-jupiter-params:5.5.2" level="project" />
+    <orderEntry type="library" scope="TEST" name="Maven: org.junit.jupiter:junit-jupiter-engine:5.5.2" level="project" />
+    <orderEntry type="library" scope="TEST" name="Maven: org.junit.platform:junit-platform-engine:1.5.2" level="project" />
+  </component>
+</module>

src/main/java/com/epam/izh/rd/online/service/SimpleMathService.java

@@ -1,5 +1,9 @@
 package com.epam.izh.rd.online.service;
 
+//import java.math.BigInteger;
+
+import static java.lang.Math.sqrt;
+
 public class SimpleMathService implements MathService {
 
     /**
@@ -13,16 +17,25 @@ public class SimpleMathService implements MathService {
      */
     @Override
     public int compare(int value1, int value2) {
-        return -2;
-    }
+        if (value1 == value2) {
+            return 0;}
+        else if (value1 < value2) {
+            return  -1;}
+        else {
+            return 1; }
+     }
 
     /**
      * Метод возвращает максимальное число из пары.
      * Например для списка (-1, 2) метод должен вернуть 2
      */
     @Override
     public int maxFrom(int value1, int value2) {
-        return -1;
+        if (value1 > value2) {
+            return value1; }
+        else {
+            return value2;
+        }
     }
 
     /**
@@ -31,16 +44,27 @@ public int maxFrom(int value1, int value2) {
      */
     @Override
     public int maxFrom(int[] values) {
-        return -1;
+        int maxValue = 0;
+        for (int i = 0; i < values.length; i++) {
+            if (values[i] > maxValue) {
+                maxValue = values[i];
+            }
+        }
+        return maxValue;
     }
 
+
     /**
      * Метод возвращает сумму чисел массива.
      * Например для списка {-1, -3, 4, 8, 5, 22, -5} метод должен вернуть 30
      */
     @Override
     public int sum(int[] values) {
-        return -1;
+        int sumArray = 0;
+        for (int i=0; i < values.length; i++){
+            sumArray +=values[i];
+        }
+        return sumArray;
     }
 
     /**
@@ -49,7 +73,21 @@ public int sum(int[] values) {
      */
     @Override
     public int[] getEvenDigits(int[] values) {
-        return new int[]{};
+        int countOfEven = 0;
+        for (int i =0; i < values.length; i++){
+            if (values[i] % 2 == 0) {
+                countOfEven++;
+            }
+        }
+        int[] evenArray = new int[countOfEven];
+        for (int i = 0, j = 0; i < values.length; i++){
+            if (values[i] % 2 == 0){
+                evenArray[j] = values[i];
+                j++;
+            }
+        }
+
+        return  evenArray;
     }
 
     /**
@@ -59,7 +97,11 @@ public int[] getEvenDigits(int[] values) {
      */
     @Override
     public long calcFactorial(int initialVal) {
-        return -1L;
+        if (initialVal <= 1) {
+            return 1;
+        } else {
+            return initialVal * calcFactorial(initialVal - 1);
+        }
     }
 
     /**
@@ -74,7 +116,13 @@ public long calcFactorial(int initialVal) {
      */
     @Override
     public long calcFibonacci(int number) {
-        return -1L;
+        if (number <= 0) {
+            return 0;
+        } else if (number == 1) {
+            return 1;
+        } else  {
+            return calcFibonacci(number - 1) + calcFibonacci(number - 2);
+        }
     }
 
     /**
@@ -83,7 +131,20 @@ public long calcFibonacci(int number) {
      */
     @Override
     public int[] sort(int[] values) {
-        return new int[]{};
+        for (int i = 0; i < values.length; i++){
+            int min = values[i];
+            int minId = i;
+            for (int j = i + 1; j < values.length; j++) {
+                if (values[j] < min) {
+                    min = values[j];
+                    minId = j;
+                }
+            }
+            int temp = values[i];
+            values[i] = min;
+            values[minId] = temp;
+        }
+        return values;
     }
 
     /**
@@ -94,16 +155,27 @@ public int[] sort(int[] values) {
      */
     @Override
     public boolean isPrimary(int number) {
-        return false;
+            for (int i = 2; i <= sqrt(number); i++){
+            if (number % i == 0) return false;
+            }
+            return true;
     }
 
+
     /**
      * Метод возвращает массив, в котором элементы расположены в обратном порядке.
      *
      * Например для массива {-1, -3, 4, 8, 5, 22, -5} метод вернет {-5, 22, 5, 8, 4, -3, -1}
      */
     @Override
     public int[] reverseArray(int[] values) {
-        return new int[]{};
+        int[] reverseArray = new int[values.length];
+        int reveseCaunt = values.length - 1;
+        for (int i = 0; i < values.length; i++){
+            reverseArray[reveseCaunt] = values[i];
+            reveseCaunt--;
+        }
+        return reverseArray;
+
     }
 }