2019 字节笔试题“油豆瓶”

Scanner scanner = new Scanner(System.in); int num = scanner.nextInt(); int[][] arr = new int[num][num]; for (int i = 0; i < num; i++) { for (int j = 0; j < num; j++) { arr[i][j] = scanner.nextInt(; } } Set<Integer> set1 = new HashSet<>(); int count = 0; for (int i = 0; i < num; i++) { for (int j = i + 1; j < num; j++) { if (arr[i][j] > 3) { if (!(set1.contains(i) || set1.contains(j))) { count++; } set1.add(i); set1.add(j); } } } int left = num - set1.size(); System.out.println(count + left); 

题目自行百度把。心态有点难受

俺刷了一整天算法题，笔试的时候第一题都没 100%通过，油豆瓶通过率 90%，尽力而自闭

改进后的版本：不晓得对不对，合并了循环；判断条件中>3 改成了>=3 （感觉剩下的 10%就是因为这个没通过，因

为我同学>=3 通过了）

Scanner scanner = new Scanner(System.in); int num = scanner.nextInt(); int[][] arr = new int[num][num]; Set<Integer> set1 = new HashSet<>(); int count = 0; for (int i = 0; i < num; i++) { for (int j = 0; j < num; j++) { arr[i][j] = scanner.nextInt(); if (arr[i][j] >= 3) { if (!(set1.contains(i) || set1.contains(j))) { count++; } set1.add(i); set1.add(j); } } } int left = num - set1.size(); System.out.println(count + left);