my own leetcode view;

Author: cdToucher

src/me/codebase/leetcode/Test.java

@@ -0,0 +1,67 @@
+package me.codebase.leetcode;
+
+import java.util.HashMap;
+import java.util.Map;
+
+/**
+ * Created by chendong on 2017/12/13.
+ */
+public class Test {
+
+
+    public static void main(String[] args) {
+        Integer[] arr1 = {1, 2, 3};
+        Integer[] arr2 = {2, 3, 4};
+
+        int mid1 = arr1.length / 2;
+        int mid2 = arr2.length / 2;
+    }
+
+    /*   public static int lengthOfLongestSubstring(String s) {
+           int len;
+           if (s == null || (len = s.length()) == 0) return 0;
+           int preP = 0, max = 0;
+           int[] hash = new int[128];
+           for (int i = 0; i < len; ++i) {
+               char c = s.charAt(i);
+               if (hash[c] > preP) {
+                   preP = hash[c];
+               }
+               int l = i - preP + 1;
+               hash[c] = i + 1;
+               if (l > max) max = l;
+           }
+           return max;
+       }
+   */
+    private static String distinct(String str) {
+        Map<Character, Integer> map = new HashMap<>();
+        char[] chars = str.toCharArray();
+        for (int i = 0; i < chars.length; i++) {
+
+            if (map.get(chars[i]) != null)
+                map.put(chars[i], i - map.get(chars[i]));
+            else
+                map.put(chars[i], i);
+        }
+        return null;
+    }
+
+
+
+
+/*
+    private static String findSubString(String str, int index) {
+        char[] chars = str.toCharArray();
+        int l = 1;
+        for (int i = index; i < chars.length; i++) {
+            if (chars[i] != chars[i++]) {
+                l++;
+            }else break;
+        }
+        return String.valueOf()
+    }
+*/
+
+
+}

src/me/codebase/leetcode/_002.java

@@ -0,0 +1,38 @@
+package me.codebase.leetcode;
+
+/**
+ * Created by chendong on 2017/12/13.
+ */
+public class _002 {
+
+    private static Node add(Node n1, Node n2) {
+        int over = 0;
+        Node root = null;
+        Node node = null;
+        while (n1 != null && n2 != null) {
+            Node n = new Node(0);
+            n.val = (n1.val + n2.val + over) % 10;
+            over = (n1.val + n2.val) / 10;
+            n1 = n1.next;
+            n2 = n2.next;
+            if (node == null) {
+                node = n;
+                root = node;
+            } else
+                node.next = n;
+            if (node.next != null)
+                node = node.next;
+        }
+        return root;
+    }
+
+    static class Node {
+        int val;
+        Node next;
+
+        public Node(int val) {
+            this.val = val;
+        }
+    }
+
+}