feat: add 083

Author: Blankj

README.md

@@ -24,6 +24,7 @@
 |67|[Add Binary][067]|Math, String|
 |69|[Sqrt(x)][069]|Binary Search, Math|
 |70|[Climbing Stairs][070]|Dynamic Programming|
+|83|[Remove Duplicates from Sorted List][083]|Linked List|
 
 
 ## Medium
@@ -66,3 +67,4 @@
 [067]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/067/README.md
 [069]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/069/README.md
 [070]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/070/README.md
+[083]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/083/README.md

note/070/README.md

@@ -8,7 +8,7 @@ Each time you can either climb 1 or 2 steps. In how many distinct ways can you c
 
 **Note:** Given *n* will be a positive integer.
 
-**Tags:** Binary Search, Math
+**Tags:** Dynamic Programming
 
 
 ## 思路

note/083/README.md

@@ -0,0 +1,51 @@
+# [Remove Duplicates from Sorted List][title]
+
+## Description
+
+Given a sorted linked list, delete all duplicates such that each element appear only *once*.
+
+For example,
+Given `1->1->2`, return `1->2`.
+Given `1->1->2->3->3`, return `1->2->3`.
+
+**Tags:** Linked List
+
+
+## 思路
+
+题意是删除链表中重复的元素，很简单，我们只需要遍历一遍链表，遇到链表中相邻元素相同时，把当前指针指向下下个元素即可。
+
+``` java
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode(int x) { val = x; }
+ * }
+ */
+public class Solution {
+    public ListNode deleteDuplicates(ListNode head) {
+        if (head == null || head.next == null) return head;
+        ListNode curr = head;
+        while (curr.next != null) {
+            if (curr.next.val == curr.val) {
+                curr.next = curr.next.next;
+            } else {
+                curr = curr.next;
+            }
+        }
+        return head;
+    }
+}
+```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我GitHub上的LeetCode题解：[awesome-java-leetcode][ajl]
+
+
+
+[title]: https://leetcode.com/problems/remove-duplicates-from-sorted-list
+[ajl]: https://github.com/Blankj/awesome-java-leetcode

project/LeetCode/leetcode/src/main/java/com/blankj/easy/_021/Solution.java

@@ -1,5 +1,7 @@
 package com.blankj.easy._021;
 
+import com.blankj.structure.ListNode;
+
 /**
  * <pre>
  *     author: Blankj
@@ -10,27 +12,6 @@
  */
 
 public class Solution {
-
-    static class ListNode {
-        int val;
-        ListNode next;
-
-        ListNode(int x) {
-            val = x;
-        }
-
-        @Override
-        public String toString() {
-            String str = "[" + String.valueOf(val);
-            ListNode p = next;
-            while (p != null) {
-                str += ", " + String.valueOf(p.val);
-                p = p.next;
-            }
-            return str + "]";
-        }
-    }
-
     public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
         ListNode head = new ListNode(0);
         ListNode temp = head;
@@ -50,6 +31,7 @@ public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
 
     public static void main(String[] args) {
         Solution solution = new Solution();
+        ;
         ListNode listNode00 = new ListNode(1);
         ListNode listNode01 = new ListNode(3);
         ListNode listNode02 = new ListNode(5);
@@ -70,8 +52,10 @@ public static void main(String[] args) {
         listNode12.next = listNode13;
         listNode13.next = listNode14;
         listNode14.next = null;
-        System.out.println(listNode00.toString());
-        System.out.println(listNode10.toString());
-        System.out.println(solution.mergeTwoLists(listNode00, listNode10).toString());
+        ListNode listNode0 = ListNode.createTestData(new int[]{1, 3, 5, 7, 9});
+        ListNode listNode1 = ListNode.createTestData(new int[]{2, 4, 6, 8, 10});
+        System.out.println(listNode0.toString());
+        System.out.println(listNode1.toString());
+        System.out.println(solution.mergeTwoLists(listNode0, listNode1).toString());
     }
 }

project/LeetCode/leetcode/src/main/java/com/blankj/easy/_083/Solution.java

@@ -0,0 +1,34 @@
+package com.blankj.easy._083;
+
+import com.blankj.structure.ListNode;
+
+/**
+ * <pre>
+ *     author: Blankj
+ *     blog  : http://blankj.com
+ *     time  : 2017/05/10
+ *     desc  :
+ * </pre>
+ */
+
+public class Solution {
+    public ListNode deleteDuplicates(ListNode head) {
+        if (head == null || head.next == null) return head;
+        ListNode curr = head;
+        while (curr.next != null) {
+            if (curr.next.val == curr.val) {
+                curr.next = curr.next.next;
+            } else {
+                curr = curr.next;
+            }
+        }
+        return head;
+    }
+
+    public static void main(String[] args) {
+        Solution solution = new Solution();
+
+        System.out.println(solution.deleteDuplicates(ListNode.createTestData(new int[]{1, 1, 2})));
+        System.out.println(solution.deleteDuplicates(ListNode.createTestData(new int[]{1, 1, 2, 3, 3})));
+    }
+}

project/LeetCode/leetcode/src/main/java/com/blankj/structure/ListNode.java

@@ -0,0 +1,42 @@
+package com.blankj.structure;
+
+/**
+ * <pre>
+ *     author: Blankj
+ *     blog  : http://blankj.com
+ *     time  : 2017/05/18
+ *     desc  :
+ * </pre>
+ */
+public class ListNode {
+
+    public int      val;
+    public ListNode next;
+
+    public ListNode(int x) {
+        val = x;
+    }
+
+    @Override
+    public String toString() {
+        String str = "[" + String.valueOf(val);
+        ListNode p = next;
+        while (p != null) {
+            str += ", " + String.valueOf(p.val);
+            p = p.next;
+        }
+        return str + "]";
+    }
+
+    public static ListNode createTestData(int[] data) {
+        int len =  len = data.length;
+        if (len == 0) return null;
+        ListNode[] listNode = new ListNode[len + 1];
+        listNode[0] = new ListNode(data[0]);
+        for (int i = 1; i < len; i++) {
+            listNode[i] = new ListNode(data[i]);
+            listNode[i - 1].next = listNode[i];
+        }
+        return listNode[0];
+    }
+}