java/MilkyDoughnut.java at main · IFEANYIBRIGHT/java · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
public class MilkyDoughnut{

    public static int countEven(int [] numbers){

    int count = 0;

    for(int index = 0; index < numbers.length;index++){

    if(numbers[index] % 2 == 0){

    count ++;

    }

    }
    return count;
 }


    public static int linearSearch(int[] numbers,int target){

    for(int count = 0 ;count < numbers.length;count++){

        if(numbers[count] == target){

            return count ;
        }
    }

        return -1 ;
}


    public static boolean arraysEqualsLengthAndValues(int [] firstArray,int [] secondArray){

    for(int count = 0;count < firstArray.length;count ++){

         for(int index = 0;index < secondArray.length;index ++){
            if(firstArray[count] == secondArray[index]){
            return true ;

            }
         }
      }

     return false;

   }


<<<<<<< HEAD

    public static int[] perfectSquare(int number){

            int result [] = new int[number];

            for(int count = 0;count < number;count++){
            result [count] = count + 1  * count + 1;

        }

        return result;
=======
public static int[] getPerfectSquares(int number) {

    int[] result = new int[number];

    for (int count = 0; count < number; count++) {
        int currentNumber = count + 1;
        result[count] = currentNumber * currentNumber;
    }

    return result;

>>>>>>> 8015333 (added perfect squares solution)


    }


}