Merge pull request algorithm001#640 from AndroidQin/master

GeekUniversity · web-flow · commit d5226afdbaad · 2019-05-08T14:04:34.000+08:00
&#31532;&#19977;&#21608;&#21644;&#31532;&#22235;&#21608;
diff --git a/Week_03/id_95/LeetCode_373_95.java b/Week_03/id_95/LeetCode_373_95.java
@@ -0,0 +1,28 @@
+public class LeetCode_373_95 {
+    public List<int[]> kSmallestPairs(int[] nums1, int[] nums2, int k) {
+        List<int[]> res = new LinkedList<>();
+        Queue<int[]> queue = new PriorityQueue<>(k,new Comparator<int[]>(){
+            public int compare(int[] o1,int[] o2){
+                int tmp1 = o1[0]+o1[1];
+                int tmp2 = o2[0]+o2[1];
+
+                return tmp1 - tmp2;
+            }            
+        });
+
+       for(int i = 0;i<nums1.length;i++){
+           for(int j = 0;j<nums2.length;j++){
+               queue.add(new int[]{nums1[i],nums2[j]});
+           }
+       }
+
+       while(k-->0){
+           int[] tmp = queue.poll();
+           if(tmp == null)
+                break;
+            res.add(tmp);
+       }
+
+       return res;
+    }
+}
diff --git a/Week_03/id_95/LeetCode_997_95.java b/Week_03/id_95/LeetCode_997_95.java
@@ -0,0 +1,17 @@
+class LeetCode_997_95 {
+    public int findJudge(int N, int[][] trust) {
+        int i,j;
+        int[] res = new int[N];
+        int[] flag = new int[N];
+        for(i=0;i<trust.length;i++) {
+            flag[trust[i][0]-1]=1;//&#20449;&#20219;&#20102;&#21035;&#20154;&#65292;&#19981;&#21487;&#33021;&#26159;&#27861;&#23448;
+            res[trust[i][1]-1]++; //&#32479;&#35745;&#36825;&#20010;&#20154;&#34987;&#20449;&#20219;&#30340;&#27425;&#25968;
+        }
+        for(i=0;i<N;i++) {
+            if(res[i]==N-1 && flag[i]==0) {
+                return i+1;
+            }
+        }
+        return -1;
+    }
+}
diff --git a/Week_04/id_95/LeetCode_455_95.java b/Week_04/id_95/LeetCode_455_95.java
@@ -0,0 +1,17 @@
+class LeetCode_455_95 {
+    public int findContentChildren(int[] g, int[] s) {
+        int count = 0;
+ 
+        Arrays.sort(g);
+        Arrays.sort(s);
+ 
+        for (int i = 0,j = 0; i < g.length && j < s.length; ) 
+            if (g[i] <= s[j]){
+                count++;
+                i++;
+                j++;
+            }else j++;
+ 
+        return count;
+    }
+}
diff --git a/Week_04/id_95/LeetCode_784_95.java b/Week_04/id_95/LeetCode_784_95.java
@@ -0,0 +1,28 @@
+class LeetCode_784_95 {
+    public List<String> letterCasePermutation(String S) {
+        List<String> list = new ArrayList<>();
+        String temp = "";
+        letter(list,S,temp,0);
+        return list;
+    }
+    
+    public static void letter(List<String> list,String S, String temp , int index){
+ 
+        if (S.length() == temp.length()) list.add(temp);
+        
+        if (index == S.length()) return;
+ 
+        temp+=S.charAt(index);
+        letter(list,S,temp,index+1);
+        temp = temp.substring(0,temp.length()-1);
+        
+        if (S.charAt(index) >= 'a' && S.charAt(index) <= 'z'){//&#23567;&#20889;&#23383;&#27597;a-z
+            temp += (char)(S.charAt(index) + 'A' - 'a');
+            letter(list,S,temp,index+1);
+         }else if(S.charAt(index) >= 'A' && S.charAt(index) <= 'Z'){//&#22823;&#20889;&#23383;&#27597;A-Z
+            temp += (char)(S.charAt(index) + 'a' - 'A');
+            letter(list,S,temp,index+1);
+        }
+        
+    }
+}
