2024/10/06 418周赛 Q2错误

src/main/java/com/cool/week_match/week418/Q1.java

@@ -0,0 +1,52 @@
+package com.cool.week_match.week418;
+
+/**
+ * Created with IntelliJ IDEA.
+ *
+ * @Author: Cool
+ * @Date: 2024/10/06/10:36
+ * @Description:
+ */
+public class Q1 {
+
+    public int maxGoodNumber(int[] nums) {
+        String[] strs = new String[6];
+        strs[0] = transToTwo(nums[0]) + transToTwo(nums[1]) + transToTwo(nums[2]);
+        strs[1] = transToTwo(nums[0]) + transToTwo(nums[2]) + transToTwo(nums[1]);
+        strs[2] = transToTwo(nums[1]) + transToTwo(nums[2]) + transToTwo(nums[0]);
+        strs[3] = transToTwo(nums[1]) + transToTwo(nums[0]) + transToTwo(nums[2]);
+        strs[4] = transToTwo(nums[2]) + transToTwo(nums[1]) + transToTwo(nums[0]);
+        strs[5] = transToTwo(nums[2]) + transToTwo(nums[0]) + transToTwo(nums[1]);
+        int max=0;
+        for(String str:strs){
+            max=Math.max(max,transToTen(str));
+        }
+        return max;
+    }
+
+    private String transToTwo(int num) {
+        if (num == 0) {
+            return "0";
+        }
+        StringBuilder builder = new StringBuilder();
+        while (num != 0) {
+            int number = num % 2;
+            builder.append(number);
+            num = num / 2;
+        }
+        builder.reverse();
+        return builder.toString();
+    }
+
+    private int transToTen(String str) {
+        char[] chars = str.toCharArray();
+        int multiple = 1;
+        int res = 0;
+        for (int i = chars.length - 1; i >= 0; i--) {
+            res += (chars[i] - '0') * multiple;
+            multiple *= 2;
+        }
+        return res;
+    }
+
+}

src/main/java/com/cool/week_match/week418/Q2.java

@@ -0,0 +1,53 @@
+package com.cool.week_match.week418;
+
+import org.junit.Test;
+
+import java.util.ArrayList;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+
+/**
+ * Created with IntelliJ IDEA.
+ *
+ * @Author: Cool
+ * @Date: 2024/10/06/11:13
+ * @Description:
+ */
+public class Q2 {
+
+    public List<Integer> remainingMethods(int n, int k, int[][] invocations) {
+        List<Integer> list = new ArrayList<>();
+        Map<Integer, List<Integer>> map = new HashMap<>();
+        for (int[] methods : invocations) {
+            List<Integer> list1;
+            if(!map.containsKey(methods[0])){
+                list1 = new ArrayList<>();
+            }else{
+                list1 = map.get(methods[0]);
+            }
+            list1.add(methods[1]);
+            map.put(methods[0], list1);
+        }
+        if (!map.containsKey(k)) {
+            for (int i = 0; i < n; i++) {
+                if (i != k) {
+                    list.add(i);
+                }
+            }
+            return list;
+        }
+        return null;
+    }
+    private void dfs(Map<Integer,List<Integer>> map,int k,int[][]invocations,int cur){
+
+    }
+    @Test
+    public void test(){
+        int n=5;
+        int k=0;
+        int[][]invocations=new int[][]{
+                {1,2},{0,2},{0,1},{3,4}
+        };
+    }
+}