-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathArrayHelper.java
More file actions
158 lines (139 loc) · 3.82 KB
/
Copy pathArrayHelper.java
File metadata and controls
158 lines (139 loc) · 3.82 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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
public class ArrayHelper {
public static void display(int[] nums) {
System.out.print("[");
for (int i = 0; i < nums.length - 1; i++) {
System.out.print(nums[i] + ", ");
}
System.out.println(nums[nums.length - 1] + "]");
}
public static void display(double[] nums) {
System.out.print("[");
for (int i = 0; i < nums.length - 1; i++) {
System.out.print(nums[i] + ", ");
}
System.out.println(nums[nums.length - 1] + "]");
}
public static void fill(int[] nums, int x) {
for (int i = 0; i < nums.length; i++) {
nums[i] = x;
}
}
public static void fill(double[] nums, double x) {
for (int i = 0; i < nums.length; i++) {
nums[i] = x;
}
}
public static boolean contains(int[] nums, int x) {
for (int num : nums) {
if (num == x) {
return true;
}
}
return false;
}
public static boolean contains(double[] nums, double x) {
for (double num : nums) {
if (num == x) {
return true;
}
}
return false;
}
public static int count(int[] nums, int x) {
int count = 0;
for (int num : nums) {
if (num == x) {
count++;
}
}
return count;
}
public static int count(double[] nums, double x) {
int count = 0;
for (double num : nums) {
if (num == x) {
count++;
}
}
return count;
}
public static int sum(int[] nums) {
int sum = 0;
for (int num : nums) {
sum += num;
}
return sum;
}
public static double sum(double[] nums) {
double sum = 0;
for (double num : nums) {
sum += num;
}
return sum;
}
public static int indexOf(int[] nums, int x) {
for (int i = 0; i < nums.length; i++) {
if (nums[i] == x) {
return i;
}
}
return -1;
}
public static int indexOf(double[] nums, double x) {
for (int i = 0; i < nums.length; i++) {
if (nums[i] == x) {
return i;
}
}
return -1;
}
public static int max(int[] nums) {
int max = nums[0];
for (int i = 1; i < nums.length; i++) {
if (nums[i] > max) {
max = nums[i];
}
}
return max;
}
public static double max(double[] nums) {
double max = nums[0];
for (double num : nums) {
if (num > max) {
max = num;
}
}
return max;
}
public static int min(int[] nums) {
int min = nums[0];
for (int i = 1; i < nums.length; i++) {
if (nums[i] < min) {
min = nums[i];
}
}
return min;
}
public static int[] subarray(int[] nums, int beg, int end) {
int[] sub = new int[end - beg];
for (int i = 0; i < sub.length; i++) {
sub[i] = nums[i + beg];
}
return sub;
}
public static double[] merge(double[] a, double[] b) {
double[] nums = new double[a.length + b.length];
for (int i = 0; i < nums.length; i++) {
if (i < a.length) {
nums[i] = a[i];
} else {
nums[i] = b[i - a.length];
}
}
return nums;
}
public static double[] mergeIntToArray(double a, double b) {
double[] nums = {a, b};
return nums;
}
}