tree

Author: tang11

src/main/java/com/algorithm/bytype/sort/Solution.java

@@ -0,0 +1,29 @@
+package com.algorithm.bytype.sort;
+
+/**
+ * @author shenli
+ * @date 2021/11/25
+ */
+public class Solution {
+    public int solution(int[] A) {
+
+        int min = Integer.MAX_VALUE;
+
+        for (int p = 1; p < A.length - 2; p++) {
+            for (int q = p + 2; q < A.length - 1; q++) {
+                if (A[p] + A[q] < min) {
+                    min = A[p] + A[q];
+                }
+            }
+
+        }
+        return min;
+    }
+
+    public static void main(String[] args) {
+        int[] A = new int[]{5, 2, 4, 6, 3, 1, 7};
+        Solution solution = new Solution();
+        System.out.print(solution.solution(A));
+    }
+
+}

src/main/java/com/algorithm/leetcode/tree/easy/FindMode.java

@@ -3,6 +3,7 @@
 import com.algorithm.leetcode.tree.TreeNode;
 
 import java.util.ArrayList;
+import java.util.HashMap;
 import java.util.List;
 
 /**
@@ -55,4 +56,13 @@ public void update(int x) {
             res.add(base);
         }
     }
+
+    public static void main(String[] args) {
+        HashMap <Character,Integer> map = new HashMap<>();
+        String s = "456";
+        char d1 = 'c';
+        char d2= 'c';
+        System.out.println(d1==d2);
+        System.out.println(Integer.parseInt(s.substring(0,3)));
+    }
 }