-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathunitTesting.java
More file actions
59 lines (52 loc) · 1.09 KB
/
Copy pathunitTesting.java
File metadata and controls
59 lines (52 loc) · 1.09 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
package UnitTesting;
import java.awt.List;
import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Arrays;
public class unitTesting {
public long addInts(long x, long y) {
return x + y;
}
public String addStrings(String x, String y) {
return x + y;
}
public int findLen(String s) {
return s.length();
}
public Object divXbyY(int x, int y) {
if (x / y > 0) {
return (x / y);
}
else {
return null;
}
}
public int[] reverseIntArray(int[] IntArray) {
int len = IntArray.length;
int[] output = new int[len];
for (int i=0;i<len;i++){
output[i]= IntArray[len-1-i];
System.out.print(output);
}
return output;
}
public ArrayList<Integer> range(int x, int y, int z, int r) {
int num1=x;
int num2=y;
int num3=z;
ArrayList<Integer> list = new ArrayList<Integer>();
for(int i = 0; i<r; i++) {
if (i<r){
num1 +=1;
num2 +=1;
num3 +=1;
}
else {
list.add(num1);
list.add(num2);
list.add(num3);
}
}
return(list);
}
}