Code Hunt Sector 11 Arrays 2 - Java

摘要: Code Hunt Sector 11 Arrays 2 - Java

微软编码游戏 https://www.codehunt.com

Code Hunt 11.01

[code=language-java]public class Program {
public static int[] Puzzle(int[] a, int [] b) {
int[] result = new int[Math.max(a.length, b.length)];
for (int i = 0; i < result.length; i++) {
result[i] = (i < a.length && i < b.length) ? Math.abs(a[i] - b[i]) : i < a.length ? a[i] : Math.abs(b[i]);
}
return result;
}
}

Code Hunt 11.02

[code=language-java]public class Program {
public static String[] Puzzle(String[] a, int amount) {
String[] result = new String[a.length * amount];
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < amount; j++) {
result[i * amount + j] = a[i];
}
}
return result;
}
}

Code Hunt 11.03

[code=language-java]public class Program {
public static Boolean Puzzle(int[][] input) {
int sum1 = 0;
int sum2 = 0;
for (int i = 0; i < input.length; i++) {
sum1 += input[i][i];
sum2 += input[i][input.length - 1 - i];
}
return sum1 == sum2;
}
}

Code Hunt 11.04

[code=language-java]public class Program {
public static int[] Puzzle(int[] list, int modBy) {
for (int i = 0; i < list.length; i++) {
list[i] = list[i] % modBy;
}
return list;
}
}

Code Hunt 11.05

[code=language-java]public class Program {
public static String[] Puzzle(String[] list) {
String[] result = new String[list.length % 2 == 0 ? list.length / 2 : (list.length + 1) / 2];
for (int i = 0; i < list.length; i+=2) {
result[i / 2] = i + 1 < list.length ? list[i] + list[i + 1] : list[i];
}
return result;
}
}

Code Hunt 11.06

[code=language-java]public class Program {
public static String[] Puzzle(int[] grades, int A, int B, int C, int D) {
String[] result = new String[grades.length];
for (int i = 0; i < grades.length; i++) {
result[i] = grade(grades[i], A, B, C, D);
}
return result;
}

private static String grade(int grade, int A, int B, int C, int D) {
if (grade >= A) {
return "A";
} else if (grade >= B) {
return "B";
} else if (grade >= C) {
return "C";
} else if (grade >= D) {
return "D";
}
return "E";
}
}

Code Hunt 11.07

[code=language-java]public class Program {
public static String[][] Puzzle(String[][] input) {
for (int i = 0; i < input.length - 1; i++) {
for (int j = i + 1; j < input.length; j++) {
String temp = input[i][j];
input[i][j] = input[j][i];
input[j][i] = temp;
}
}
return input;
}
}