0083. Remove Duplicates from Sorted List

coderbean · coderbean · commit b917e34ebda5 · 2019-07-30T15:28:03.000+08:00
diff --git a/markdown/0083. Remove Duplicates from Sorted List.md b/markdown/0083. Remove Duplicates from Sorted List.md
@@ -0,0 +1,59 @@
+### [83\. Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/)
+
+Difficulty: **Easy**
+
+
+Given a sorted linked list, delete all duplicates such that each element appear only _once_.
+
+**Example 1:**
+
+```
+Input: 1->1->2
+Output: 1->2
+```
+
+**Example 2:**
+
+```
+Input: 1->1->2->3->3
+Output: 1->2->3
+```
+
+
+#### Solution
+
+Language: **Java**
+
+```java
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ * int val;
+ * ListNode next;
+ * ListNode(int x) { val = x; }
+ * }
+ */
+class Solution {
+    public ListNode deleteDuplicates(ListNode head) {
+        if (head == null) {
+            return null;
+        }
+        ListNode curr = head;
+        ListNode nextIndex = head;
+        while (curr.next != null) {
+            while (curr.next != null && curr.val == curr.next.val) {
+                curr = curr.next;
+            }
+            if (curr != nextIndex) {
+                nextIndex.next = curr.next;
+                nextIndex = curr;
+            } else {
+                curr = curr.next;
+                nextIndex = nextIndex.next;
+            }
+        }
+        return head;
+    }
+}
+```
+![pic](https://raw.githubusercontent.com/PicGoBed/PicBed/master/2019-07-30-5KXuLX.jpg)
diff --git a/src/main/java/leetcode/_83_/Main.java b/src/main/java/leetcode/_83_/Main.java
@@ -0,0 +1,30 @@
+package leetcode._83_;
+
+import leetcode.common.ListNode;
+
+/**
+ * Created by zhangbo54 on 2019-03-04.
+ */
+public class Main {
+    public static void main(String[] args) {
+        Solution solution = new Solution();
+
+        ListNode node1 = new ListNode(1);
+        ListNode node2 = new ListNode(1);
+        ListNode node31 = new ListNode(2);
+        ListNode node32 = new ListNode(3);
+        ListNode node41 = new ListNode(4);
+        ListNode node42 = new ListNode(4);
+        ListNode node5 = new ListNode(5);
+        node1.next = node2;
+        node2.next = node31;
+        node31.next = node32;
+        node32.next = node41;
+        node41.next = node42;
+        node42.next = node5;
+
+
+        System.out.println(solution.deleteDuplicates(node1));
+    }
+}
+
diff --git a/src/main/java/leetcode/_83_/Solution.java b/src/main/java/leetcode/_83_/Solution.java
@@ -0,0 +1,26 @@
+package leetcode._83_;
+
+import leetcode.common.ListNode;
+
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ * int val;
+ * ListNode next;
+ * ListNode(int x) { val = x; }
+ * }
+ */
+class Solution {
+    public ListNode deleteDuplicates(ListNode head) {
+        if (head == null) {
+            return null;
+        }
+        ListNode curr = head;
+        while (curr.next != null) {
+            if (curr.val == curr.next.val) {
+
+            }
+        }
+        return head;
+    }
+}
diff --git a/src/main/java/leetcode/_83_/solution.md b/src/main/java/leetcode/_83_/solution.md
@@ -0,0 +1,59 @@
+### [83\. Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/)
+
+Difficulty: **Easy**
+
+
+Given a sorted linked list, delete all duplicates such that each element appear only _once_.
+
+**Example 1:**
+
+```
+Input: 1->1->2
+Output: 1->2
+```
+
+**Example 2:**
+
+```
+Input: 1->1->2->3->3
+Output: 1->2->3
+```
+
+
+#### Solution
+
+Language: **Java**
+
+```java
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ * int val;
+ * ListNode next;
+ * ListNode(int x) { val = x; }
+ * }
+ */
+class Solution {
+    public ListNode deleteDuplicates(ListNode head) {
+        if (head == null) {
+            return null;
+        }
+        ListNode curr = head;
+        ListNode nextIndex = head;
+        while (curr.next != null) {
+            while (curr.next != null && curr.val == curr.next.val) {
+                curr = curr.next;
+            }
+            if (curr != nextIndex) {
+                nextIndex.next = curr.next;
+                nextIndex = curr;
+            } else {
+                curr = curr.next;
+                nextIndex = nextIndex.next;
+            }
+        }
+        return head;
+    }
+}
+```
+![pic](https://raw.githubusercontent.com/PicGoBed/PicBed/master/2019-07-30-5KXuLX.jpg)
