-
Notifications
You must be signed in to change notification settings - Fork 9
Expand file tree
/
Copy pathIntegerArrayUtils.java
More file actions
82 lines (73 loc) · 2.86 KB
/
IntegerArrayUtils.java
File metadata and controls
82 lines (73 loc) · 2.86 KB
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
package com.dtcc.exams.arrays;
public class IntegerArrayUtils {
/**
* @param integerArray - array to have value added to it
* @param valueToBeAdded - value to be added to the end of the array
* @return - identical array with one additional element of `valueToBeAdded` at the end of the array
*/
public static Integer[] add(Integer[] integerArray, Integer valueToBeAdded) {
int length=integerArray.length;
Integer[] newArray=new Integer[length+1];
//copy array integerArray to newArray.
System.arraycopy(integerArray,0,newArray,0,length);
newArray[length]=valueToBeAdded;
return newArray;
}
/**
* @param integerArray - array to be manipulated
* @param indexToInsertAt - index of the element to be inserted at
* @param valueToBeInserted - value of the element to be inserted
* @return `integerArray` with `valueToBeInserted` at index number `indexToInsertAt`
*/
public static Integer[] replace(Integer[] integerArray, int indexToInsertAt, Integer valueToBeInserted) {
for(int i=0;i<integerArray.length;i++){
if(i==indexToInsertAt)
integerArray[i]=valueToBeInserted;
}
return integerArray;
}
/**
* @param integerArray - array to be evaluated
* @param indexToFetch - index of element to be returned
* @return element located at `indexToFetch`
*/
public static Integer get(Integer[] integerArray, Integer indexToFetch) {
Integer fetchValue = null;
for(int i=0;i<integerArray.length;i++){
if(i==indexToFetch)
fetchValue=integerArray[i];
}
return fetchValue;
}
/**
* @param integerArray - array to be evaluated
* @return identical array with even-values incremented by 1 and odd-values decremented by 1
*/
public static Integer[] incrementEvenDecrementOdd(Integer[] integerArray) {
for(int i=0;i<integerArray.length;i++){
if(integerArray[i]%2==0){ integerArray[i]=integerArray[i]+1; }
else if(integerArray[i]%2==1) {integerArray[i]=integerArray[i]-1;}
}
return integerArray;
}
/**
* @param integerArray - array to be evaluated
* @return identical array with even-values incremented by 1
*/
public static Integer[] incrementEven(Integer[] integerArray) {
for(int i=0;i<integerArray.length;i++)
if (integerArray[i] % 2 == 0)
integerArray[i] = integerArray[i] + 1;
return integerArray;
}
/**
* @param input - array to be evaluated
* @return identical array with odd-values decremented by 1
*/
public static Integer[] decrementOdd(Integer[] input) {
for(int i=0;i<input.length;i++)
if (input[i] % 2 == 1)
input[i] = input[i] - 1;
return input;
}
}