Skip to content

Commit 73f70a6

Browse files
jdegandjdegand
committed
array-2 added
1 parent 342b5b3 commit 73f70a6

34 files changed

+480
-0
lines changed

‎array-2/bigDiff.java

Lines changed: 29 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,29 @@
1+
public int bigDiff(int[] nums) {
2+
int max = findMax(nums);
3+
int min = findMin(nums);
4+
return max - min;
5+
}
6+
7+
public int findMax(int[] nums) {
8+
int maxSoFar = nums[0]; // use nums[0] as the max to start
9+
10+
// Look at every element, starting at 1
11+
for (int i=1; i<nums.length; i++) {
12+
if (nums[i] > maxSoFar) {
13+
maxSoFar = nums[i];
14+
}
15+
}
16+
return maxSoFar;
17+
}
18+
19+
public int findMin(int[] nums) {
20+
int minSoFar = nums[0]; // use nums[0] as the min to start
21+
22+
// Look at every element, starting at 1
23+
for (int i=1; i<nums.length; i++) {
24+
if (nums[i] < minSoFar) {
25+
minSoFar = nums[i];
26+
}
27+
}
28+
return minSoFar;
29+
}

‎array-2/centeredAverage.java

Lines changed: 16 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,16 @@
1+
public int centeredAverage(int[] nums) {
2+
int max = nums[0];
3+
int min = nums[0];
4+
int total = 0;
5+
for(int i = 0; i < nums.length; i++){
6+
if(nums[i] > max){
7+
max = nums[i];
8+
}
9+
if(nums[i] < min){
10+
min = nums[i];
11+
}
12+
total += nums[i];
13+
}
14+
15+
return (total - max - min) / (nums.length - 2);
16+
}

‎array-2/countEvens.java

Lines changed: 9 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
public int countEvens(int[] nums) {
2+
int count = 0;
3+
for(int item : nums){
4+
if(item % 2 == 0){
5+
count += 1;
6+
}
7+
}
8+
return count;
9+
}

‎array-2/either24.java

Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
public boolean either24(int[] nums) {
2+
boolean twos = false;
3+
boolean fours = false;
4+
for(int i = 0; i < nums.length -1; i++){
5+
if(nums[i] == 2 && nums[i + 1] == 2) {
6+
twos = true;
7+
}
8+
if (nums[i] == 4 && nums[i+1] == 4){
9+
fours = true;
10+
}
11+
}
12+
if(twos && fours){
13+
return false;
14+
} else if (twos || fours) {
15+
return true;
16+
} else {
17+
return false;
18+
}
19+
}
20+

‎array-2/evenOdd.java

Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
public int[] evenOdd(int[] nums) {
2+
int[] arr = new int[nums.length];
3+
int evenIndex = 0;
4+
int oddIndex = nums.length-1;
5+
6+
for(int i = 0; i < nums.length; i++){
7+
if(nums[i] % 2 == 0){
8+
arr[evenIndex] = nums[i];
9+
evenIndex++;
10+
} else {
11+
arr[oddIndex] = nums[i];
12+
oddIndex--;
13+
}
14+
}
15+
16+
return arr;
17+
}
18+

‎array-2/fizzArray.java

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
public int[] fizzArray(int n) {
2+
int[] arr = new int[n];
3+
4+
for(int i = 0; i < n; i++)
5+
arr[i] = i;
6+
7+
return arr;
8+
}

‎array-2/fizzArray2.java

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
public String[] fizzArray2(int n) {
2+
String[] arr = new String[n];
3+
4+
for(int i = 0; i < n; i++) {
5+
arr[i] = String.valueOf(i);
6+
}
7+
return arr;
8+
}

‎array-2/fizzArray3.java

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
public int[] fizzArray3(int start, int end) {
2+
int n = end-start;
3+
int[] arr = new int[n];
4+
int count = start;
5+
6+
for(int i = 0; i < n; i++) {
7+
arr[i] = count;
8+
count++;
9+
}
10+
return arr;
11+
}

‎array-2/fizzBuzz.java

Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
public String[] fizzBuzz(int start, int end) {
2+
String[] arr = new String[end-start];
3+
4+
for(int i = 0; i < arr.length; i++) {
5+
int temp = i + start;
6+
if(temp % 3 == 0 && temp % 5 == 0){
7+
arr[i] = "FizzBuzz";
8+
} else if( temp % 5 == 0){
9+
arr[i] = "Buzz";
10+
} else if( temp % 3 == 0){
11+
arr[i] = "Fizz";
12+
} else{
13+
arr[i] = String.valueOf(temp);
14+
}
15+
}
16+
return arr;
17+
}
18+

‎array-2/has12.java

Lines changed: 12 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
public boolean has12(int[] nums) {
2+
boolean index1 = false;
3+
for(int i = 0; i < nums.length; i++){
4+
if(nums[i] == 1){
5+
index1 = true;
6+
}
7+
if(index1 && nums[i] == 2){
8+
return true;
9+
}
10+
}
11+
return false;
12+
}

‎array-2/has22.java

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
public boolean has22(int[] nums) {
2+
for(int i = 0; i < nums.length-1; i++){
3+
if(nums[i] == 2 && nums[i+1] == 2){
4+
return true;
5+
}
6+
}
7+
return false;
8+
}

‎array-2/has77.java

Lines changed: 10 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,10 @@
1+
public boolean has77(int[] nums) {
2+
for(int i = 0; i < nums.length; i++){
3+
if(i < nums.length - 1 && nums[i] == 7 && nums[i+1] == 7){
4+
return true;
5+
} else if(i < nums.length - 2 && nums[i] == 7 && nums[i+2] == 7){
6+
return true;
7+
}
8+
}
9+
return false;
10+
}

‎array-2/haveThree.java

Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
public boolean haveThree(int[] nums) {
2+
int count = 0;
3+
4+
if(nums.length > 1 && nums[0] == 3){ // without nums.length > 1 -> error
5+
count += 1;
6+
}
7+
8+
for(int i = 1; i < nums.length; i++){
9+
if(nums[i-1] == 3 && nums[i] == 3){
10+
return false;
11+
}
12+
if(nums[i] == 3){
13+
count += 1;
14+
}
15+
}
16+
return count == 3;
17+
}
18+

‎array-2/isEverywhere.java

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
public boolean isEverywhere(int[] nums, int val) {
2+
for(int i = 0; i < nums.length - 1; i++){
3+
if(nums[i] == val || nums[i+1] == val){
4+
continue;
5+
} else {
6+
return false;
7+
}
8+
}
9+
return true;
10+
}
11+

‎array-2/lucky13.java

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
public boolean lucky13(int[] nums) {
2+
for(int num: nums){
3+
if(num == 1 || num == 3){
4+
return false;
5+
}
6+
}
7+
return true;
8+
}

‎array-2/matchUp.java

Lines changed: 12 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
public int matchUp(int[] nums1, int[] nums2) {
2+
int count = 0;
3+
for(int i = 0; i < nums1.length; i++){
4+
if(nums1[i] == nums2[i]){
5+
continue;
6+
} else if (Math.abs(nums1[i] - nums2[i]) <= 2){
7+
count += 1;
8+
}
9+
}
10+
return count;
11+
}
12+

‎array-2/modThree.java

Lines changed: 14 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,14 @@
1+
public boolean modThree(int[] nums) {
2+
3+
if(nums.length < 3){
4+
return false;
5+
}
6+
7+
for(int i = 0; i <= nums.length - 3; i++){
8+
if(nums[i] % 2 == nums[i+1] % 2 && nums[i] % 2 == nums[i+2] % 2){
9+
return true;
10+
}
11+
12+
}
13+
return false;
14+
}

‎array-2/more14.java

Lines changed: 16 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,16 @@
1+
public boolean more14(int[] nums) {
2+
int sumOnes = 0;
3+
int sumFours = 0;
4+
for(int num : nums){
5+
if(num == 1){
6+
sumOnes += 1;
7+
} else if(num == 4){
8+
sumFours += 1;
9+
}
10+
}
11+
if(sumOnes > sumFours){
12+
return true;
13+
} else {
14+
return false;
15+
}
16+
}

‎array-2/no14.java

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
public boolean no14(int[] nums) {
2+
boolean match = Arrays.stream(nums).anyMatch(n -> n == 1 );
3+
boolean match2 = Arrays.stream(nums).anyMatch(n -> n == 4);
4+
if(match && match2){
5+
return false;
6+
}
7+
return true;
8+
}

‎array-2/notAlone.java

Lines changed: 27 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
/*
2+
3+
public int[] notAlone(int[] nums, int val) {
4+
int first = nums[0];
5+
for(int i = 1; i < nums.length-1; i++){
6+
if(nums[i] == val && nums[0] != nums[i]){
7+
if(nums[i] != nums[i+1]){
8+
if(nums[0] > nums[i+1]){
9+
nums[i] = nums[0];
10+
} else {
11+
nums[i] = nums[i+1];
12+
}
13+
}
14+
}
15+
}
16+
return nums;
17+
}
18+
*/
19+
20+
public int[] notAlone(int[] nums, int val) {
21+
for(int i = 1; i < nums.length-1; i++){
22+
if(nums[i] == val && nums[i] != nums[i-1] && nums[i] != nums[i+1]){
23+
nums[i] = Math.max(nums[i-1], nums[i+1]);
24+
}
25+
}
26+
return nums;
27+
}

‎array-2/only14.java

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
public boolean only14(int[] nums) {
2+
boolean match = Arrays.stream(nums).allMatch(n -> n == 1 || n == 4);
3+
if(match){
4+
return true;
5+
} else {
6+
return false;
7+
}
8+
}

‎array-2/post4.java

Lines changed: 14 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,14 @@
1+
public int[] post4(int[] nums) {
2+
int index = 0;
3+
for( int i =0; i < nums.length; i++){
4+
if(nums[i] == 4){
5+
index = i + 1;
6+
}
7+
}
8+
int[] arr = new int[nums.length-index];
9+
for(int i = 0; i < nums.length - index; i++){
10+
arr[i] = nums[i+index];
11+
}
12+
return arr;
13+
}
14+

‎array-2/pre4.java

Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
public int[] pre4(int[] nums) {
2+
int count = 0;
3+
for(int i = 0; i < nums.length; i++){
4+
if(nums[i] == 4){
5+
break;
6+
}
7+
count++;
8+
}
9+
int[] arr = new int[count];
10+
for(int i = 0; i < count; i++){
11+
arr[i] = nums[i];
12+
}
13+
return arr;
14+
}
15+

‎array-2/sameEnds.java

Lines changed: 9 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
public boolean sameEnds(int[] nums, int len) {
2+
// Arrays.copyOfRange twice with different indexes and compare ?
3+
for(int i = 0; i < len; i++){
4+
if(nums.length > len && nums[i] != nums[nums.length - len + i]){
5+
return false;
6+
}
7+
}
8+
return true;
9+
}

‎array-2/shiftLeft.java

Lines changed: 16 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,16 @@
1+
public int[] shiftLeft(int[] nums) {
2+
3+
if(nums.length == 0){
4+
return nums;
5+
}
6+
7+
int temp = nums[0];
8+
9+
for(int i = 0; i < nums.length - 1; i++){
10+
nums[i] = nums[i+1];
11+
}
12+
nums[nums.length-1] = temp;
13+
14+
return nums;
15+
}
16+

‎array-2/sum13.java

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
public int sum13(int[] nums) {
2+
int sum = 0;
3+
for(int i = 0; i < nums.length; i++){
4+
if(nums[i] == 13){
5+
nums[i] = 0;
6+
}
7+
8+
sum += nums[i];
9+
}
10+
return sum;
11+
}

0 commit comments

Comments
 (0)