-
Notifications
You must be signed in to change notification settings - Fork 9
Expand file tree
/
Copy pathIntegerArrayUtils.java
More file actions
88 lines (81 loc) · 2.99 KB
/
IntegerArrayUtils.java
File metadata and controls
88 lines (81 loc) · 2.99 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
83
84
85
86
87
88
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) {
Integer[] temp = new Integer[integerArray.length+1];
//Copy original contents
for(int i =0; i < integerArray.length; i++){
temp[i] = integerArray[i];
}
//Add new
temp[integerArray.length] = valueToBeAdded;
return temp;
}
/**
* @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) {
integerArray[indexToInsertAt] = 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) {
return integerArray[indexToFetch];
}
/**
* @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) {
Integer[] temp = new Integer[integerArray.length];
for(int i = 0; i < integerArray.length; i++){
if(integerArray[i] % 2 == 0){
temp[i] = (integerArray[i] + 1);
}else{
temp[i] = (integerArray[i] - 1);
}
}
return temp;
}
/**
* @param integerArray - array to be evaluated
* @return identical array with even-values incremented by 1
*/
public static Integer[] incrementEven(Integer[] integerArray) {
Integer[] temp = new Integer[integerArray.length];
for(int i = 0; i < integerArray.length; i++){
if(integerArray[i] % 2 == 0){
temp[i] = (integerArray[i] + 1);
}else{
temp[i] = integerArray[i];
}
}
return temp;
}
/**
* @param input - array to be evaluated
* @return identical array with odd-values decremented by 1
*/
public static Integer[] decrementOdd(Integer[] input) {
Integer[] temp = new Integer[input.length];
for(int i = 0; i < input.length; i++){
if(input[i] % 2 == 0){
temp[i] = (input[i]);
}else{
temp[i] = (input[i] -1);
}
}
return temp;
}
}