Array-1
public boolean firstLast6(int[] nums) {
return nums[0] == 6 || nums[nums.length - 1] == 6;
}
public boolean sameFirstLast(int[] nums) {
return nums.length > 0 && nums[0] == nums[nums.length - 1];
}
public int[] makePi() {
int[] nums = {3, 1, 4};
return nums;
}
public boolean commonEnd(int[] a, int[] b) {
return a[0] == b[0] || a[a.length - 1] == b[b.length - 1];
}
public int sum3(int[] nums) {
return nums[0] + nums[1] + nums[2];
}
public int[] rotateLeft3(int[] nums) {
int[] nums1 = {nums[1], nums[2], nums[0]};
return nums1;
}
public int[] reverse3(int[] nums) {
int[] nums1 = {nums[2], nums[1], nums[0]};
return nums1;
}
public int[] maxEnd3(int[] nums) {
if (nums[0] >= nums[2]) {
nums[2] = nums[0];
nums[1] = nums[2];
} else if (nums[2] >= nums[0]) {
nums[0] = nums[2];
nums[1] = nums[0];
}
return nums;
}
public int sum2(int[] nums) {
int len = nums.length;
if (len > 1) {
return nums[0] + nums[1];
} else if (len == 1) {
return nums[0];
}
return 0;
}
public int[] middleWay(int[] a, int[] b) {
int[] c = {a[1], b[1]};
return c;
}
public int[] makeEnds(int[] nums) {
if (nums.length > 1) {
int[] nums1 = {nums[0], nums[nums.length - 1]};
return nums1;
} else if (nums.length == 1) {
int[] nums1 = {nums[0], nums[0]};
return nums1;
}
return nums;
}
public boolean has23(int[] nums) {
boolean a = (nums[0] == 2 || nums[0] == 3) || (nums[1] == 2 || nums[1] == 3) ? true : false;
return a;
}
public boolean no23(int[] nums) {
boolean a = (nums[0] == 2 || nums[0] == 3) || (nums[1] == 2 || nums[1] == 3) ? false : true;
return a;
}
public int[] makeLast(int[] nums) {
int[] nums1 = new int[nums.length * 2];
nums1[nums1.length - 1] = nums[nums.length - 1];
return nums1;
}
public boolean double23(int[] nums) {
if (nums.length == 2) {
if ((nums[0] == 2 && nums[1] == 2) || (nums[0] == 3 && nums[1] == 3)) {
return true;
}
}
return false;
}
public int[] fix23(int[] nums) { //if 3 after 2 then change 3 on 0
if (nums[0] == 2 && nums[1] == 3) {
nums[1] = 0;
} else if (nums[1] == 2 && nums[2] == 3) {
nums[2] = 0;
}
return nums;
}
public int start1(int[] a, int[] b) {
int count = 0;
if (a.length > 0 && a[0] == 1) {
count++;
}
if (b.length > 0 && b[0] == 1) {
count++;
}
return count;
}
public int[] biggerTwo(int[] a, int[] b) {
int sum = a[0]+a[1];
int sum1 = b[0]+b[1];
if(sum > sum1){
return a;
}else if(sum1 > sum){
return b;
}
return a;
}
public int[] makeMiddle(int[] nums) {
int[] nums1 = new int[2];
if (nums.length >= 4) {
nums1[0] = nums[nums.length / 2 - 1];
nums1[1] = nums[nums.length / 2];
return nums1;
}
return nums;
}
public int[] plusTwo(int[] a, int[] b) {
int[] sum = {a[0], a[1], b[0], b[1]};
return sum;
}
public int[] swapEnds(int[] nums) {
if (nums.length >= 2) {
int a = nums[0];
nums[0] = nums[nums.length - 1];
nums[nums.length - 1] = a;
}
return nums;
}
public int[] midThree(int[] nums) {
int[] nums1 = {nums[nums.length / 2 - 1], nums[nums.length / 2], nums[nums.length / 2 + 1]};
return nums1;
}
public int maxTriple(int[] nums) {
if (nums.length >= 3) {
int maxA = Math.max(nums[0], nums[nums.length / 2]);
int maxB = Math.max(maxA, nums[nums.length - 1]);
return maxB;
} else if (nums.length == 2) {
return Math.max(nums[0], nums[1]);
}
return nums[0];
}
public int[] frontPiece(int[] nums) {
int[] nums1 = new int[2];
if (nums.length >= 2) {
nums1[0] = nums[0];
nums1[1] = nums[1];
return nums1;
}
return nums;
}
public boolean unlucky1(int[] nums) {
int len = nums.length;
if (len >= 2) {
if ((nums[0] == 1 && nums[1] == 3) || (nums[1] == 1 && nums[2] == 3)) {
return true;
} else if ((nums[len - 2] == 1) && (nums[len - 1] == 3)) {
return true;
}
}
return false;
}
public int[] make2(int[] a, int[] b) {
if (a.length >= 2) {
int[] c = {a[0], a[1]};
return c;
} else if (a.length == 1) {
int[] c = {a[0], b[0]};
return c;
} else if (a.length == 0) {
int[] c = {b[0], b[1]};
return c;
}
return a;
}
public int[] front11(int[] a, int[] b) {
if (a.length >= 1 && b.length >= 1) {
int[] c = {a[0], b[0]};
return c;
} else if (a.length == 0 && b.length >= 1) {
int[] c = {b[0]};
return c;
} else if (b.length == 0 && a.length >= 1) {
int[] c = {a[0]};
return c;
}
return a;
}
Last updated