Add files via upload

Author: linwt

2019校招真题编程题汇总_Java/Main004.java

@@ -0,0 +1,31 @@
+package CampusRecruitment2019;
+
+import java.util.Scanner;
+
+// 迷路的牛牛
+public class Main004 {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int n = sc.nextInt();
+        String str = sc.next();
+
+        // 方向抵消
+        int res = 0;
+        for (int i = 0; i < n; i++) {
+            if (str.charAt(i) == 'L')
+                res--;
+            else
+                res++;
+        }
+        // 取余判断最后方向
+        res %= 4;
+        if (res == 0)
+            System.out.println('N');
+        else if (Math.abs(res) == 2)
+            System.out.println('S');
+        else if (res == 1 || res == -3)
+            System.out.println('E');
+        else
+            System.out.println('W');
+    }
+}

2019校招真题编程题汇总_Java/Main007.java

@@ -0,0 +1,47 @@
+package CampusRecruitment2019;
+
+import java.util.Comparator;
+import java.util.Scanner;
+import java.util.Arrays;
+
+// 牛牛的闹钟
+public class Main007 {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int N = sc.nextInt();
+        int[][] clock = new int[N][2];
+        for (int i = 0; i < N; i++) {
+            clock[i][0] = sc.nextInt();
+            clock[i][1] = sc.nextInt();
+        }
+        int X = sc.nextInt();
+        int A = sc.nextInt();
+        int B = sc.nextInt();
+
+        // 对闹钟时间排序
+        Arrays.sort(clock, new Comparator<int[]>() {
+            @Override
+            public int compare(int[] o1, int[] o2) {
+                // 时钟不同则按照时钟升序排序
+                if (o1[0] != o2[0])
+                    return o1[0] - o2[0];
+                // 时钟相同则按照分钟升序排序
+                return o1[1] - o2[1];
+            }
+        });
+
+        // 获取能及时到达教室的最晚起床时间
+        int latest = A * 60 + B - X;
+        int current;
+        int i = 0;
+        while (i < N) {
+            current = clock[i][0] * 60 + clock[i][1];
+            // 当前闹钟时间与最晚起床时间比较，小于等于则继续判断下一个闹钟时间
+            if (current <= latest)
+                i++;
+            else
+                break;
+        }
+        System.out.print(clock[i - 1][0] + " " + clock[i - 1][1]);
+    }
+}

2019校招真题编程题汇总_Java/Main009.java

@@ -0,0 +1,23 @@
+package CampusRecruitment2019;
+
+import java.util.Scanner;
+import java.util.Arrays;
+
+// 俄罗斯方块
+public class Main009 {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int n = sc.nextInt();
+        int m = sc.nextInt();
+        int[] count = new int[n];
+        int[] locat = new int[m];
+        for (int i = 0; i < m; i++)
+            locat[i] = sc.nextInt();
+
+        // 统计每列的方块数，最低一列即为所获分数
+        for (int i = 0; i < m; i++)
+            count[locat[i] - 1]++;
+        int res = Arrays.stream(count).min().getAsInt();
+        System.out.println(res);
+    }
+}

2019校招真题编程题汇总_Java/Main014.java

@@ -0,0 +1,50 @@
+package CampusRecruitment2019;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.Comparator;
+import java.util.Scanner;
+
+// 塔
+public class Main014 {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int n = sc.nextInt();
+        int k = sc.nextInt();
+        int[][] tower = new int[n][2];
+        for (int i = 0; i < n; i++) {
+            tower[i][0] = i + 1;        // 记录初始位置
+            tower[i][1] = sc.nextInt(); // 记录高度
+        }
+
+        // 按照高度升序排序
+        Arrays.sort(tower, Comparator.comparingInt(o -> o[1]));
+
+        // 计算余数，可知总体平均后高度差是0还是1
+        int sum = 0;
+        for (int i = 0; i < n; i++)
+            sum += tower[i][1];
+        int rest = sum % n;
+
+        ArrayList<String> list = new ArrayList<>();
+        // 最高减最低差大于0，且有剩余操作次数
+        while (tower[n - 1][1] - tower[0][1] > 0 && k > 0) {
+            // 余数大于0且高度差为1，说明总体已经最优
+            if (rest > 0 && tower[n - 1][1] - tower[0][1] == 1) break;
+            // 最高塔往最低塔移动立方块
+            tower[0][1]++;
+            tower[n - 1][1]--;
+            k--;
+            // 记录初始相对位置的移动操作
+            list.add(tower[n - 1][0] + " " + tower[0][0]);
+            // 一次操作后数组重新升序排序
+            Arrays.sort(tower, Comparator.comparingInt(o -> o[1]));
+        }
+
+        int min = tower[0][1], max = tower[n - 1][1];
+        int delta = max - min;
+        System.out.println(delta + " " + list.size());
+        for (String str : list)
+            System.out.println(str);
+    }
+}