-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBasic.java
More file actions
124 lines (116 loc) · 2.97 KB
/
Basic.java
File metadata and controls
124 lines (116 loc) · 2.97 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
import java.util.ArrayList;
public class Basic {
//Print 1to255
boolean To255() {
for(int i = 0; i < 256; i++) {
System.out.println(i);
}
return true;
}
//Print odd numbers to 255
boolean oddsTo255() {
for(int i = 0; i < 256; i++) {
if(i%2 != 0) {
System.out.println(i);
}
}
return true;
}
//Print sums up to 255
boolean sumsTo255() {
int sum = 0;
for(int i = 0; i < 256; i++) {
sum = sum + i;
String msg = String.format("New number: %d sum: %d", i, sum);
System.out.println(msg);
}
return true;
}
//Iterate through an array
boolean iterateArray(Integer[] x) {
for(int i = 0; i < x.length; i ++) {
System.out.println(x[i]);
}
return true;
}
//Find the Max value
int findMax(Integer[] x) {
int max = x[0];
for(int i = 0; i < x.length; i ++) {
if(x[i] > max) {
max = x[i];
}
}
return max;
}
//Get average
int getAverage(Integer[] x) {
int len = x.length;
int sum = 0;
for(int i = 0; i < x.length; i ++) {
sum += x[i];
}
return(sum / len);
}
//Array with odd numbers
ArrayList<Integer> oddsArray(){
ArrayList<Integer> arr = new ArrayList<Integer>();
for(int i = 0; i < 256; i++){
if(i % 2 != 0) {
arr.add(i);
}
}
return arr;
}
//Greater than Y
int greaterThanY(Integer[] x, int y) {
int count = 0;
for(int i = 0; i < x.length; i ++) {
if(x[i] > y){
count += 1;
}
}
return count;
}
//Square The values in an Array
Integer[] squareArray(Integer[] x) {
for(int i = 0; i < x.length; i++) {
x[i] = x[i] * x[i];
}
return x;
}
//Remove Negatives
Integer[] removeNegatives(Integer[] x) {
for(int i = 0; i < x.length; i++) {
if(x[i] < 0) {
x[i] = 0;
}
}
return x;
}
//MinMaxAvg
Integer[] minMaxAvg(Integer[] x){
int max = x[0];
int min = x[0];
int sum = 0;
for(int i = 0; i < x.length; i++) {
sum += x[i];
if(x[i] > max) {
max = x[i];
}
if(x[i] > min) {
min = x[i];
}
}
Integer[] result = {min, max, (sum / x.length)};
return result;
}
//Shift Values in an Array
Integer[] shiftValues(Integer[] x) {
for(int i = 0; i < x.length - 1; i ++) {
x[i] = x[i+1];
}
x[x.length - 1] = 0;
return x;
}
}