change name for 83

fishercoder1534 · fishercoder1534 · commit 18873bf001cc · 2017-05-01T21:01:19.000-07:00
diff --git a/README.md b/README.md
@@ -338,6 +338,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |89|[Gray Code](https://leetcode.com/problems/gray-code/)|[Solution](../master/src/main/java/com/stevesun/solutions/GrayCode.java)|O(n) |O(1)|Medium|Bit Manipulation
 |86|[Partition List](https://leetcode.com/problems/partition-list/)|[Solution](../master/src/main/java/com/stevesun/solutions/PartitionList.java)|O(?) |O(?)|Medium|
 |85|[Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle/)|[Solution](../master/src/main/java/com/stevesun/solutions/MaximalRectangle.java)|O(m*n) |O(n)|Hard|DP
+|83|[Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/)|[Solution](../master/src/main/java/com/stevesun/solutions/_83.java)|O(n) |O(1)|Medium| Linked List
 |81|[Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/)|[Solution](../master/src/main/java/com/stevesun/solutions/SearchinRotatedSortedArrayII.java)|O(logn)|O(1)|Medium|Binary Search
 |80|[Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/)|[Solution](../master/src/main/java/com/stevesun/solutions/RemoveDuplicatesfromSortedArrayII.java)|O(n) |O(n)|Medium|
 |79|[Word Search](https://leetcode.com/problems/word-search/)|[Solution](../master/src/main/java/com/stevesun/solutions/WordSearch.java)|O(m*n*l) ? |O(m*n)|Medium|Backtracking/DFS
diff --git a/src/main/java/com/stevesun/solutions/_83.java b/src/main/java/com/stevesun/solutions/_83.java
@@ -7,7 +7,7 @@
  For example,
  Given 1->1->2, return 1->2.
  Given 1->1->2->3->3, return 1->2->3.*/
-public class RemoveDuplicatesfromSortedList {
+public class _83 {
 
     public static ListNode deleteDuplicates(ListNode head) {
         ListNode ret = new ListNode(-1);
diff --git a/src/test/java/com/stevesun/_83Test.java b/src/test/java/com/stevesun/_83Test.java
@@ -1,14 +1,14 @@
 package com.stevesun;
 
 import com.stevesun.common.classes.ListNode;
-import com.stevesun.solutions.RemoveDuplicatesfromSortedList;
+import com.stevesun.solutions._83;
 import org.junit.Assert;
 import org.junit.Test;
 
 /**
  * Created by stevesun on 4/18/17.
  */
-public class RemoveDuplicatesfromSortedListTest {
+public class _83Test {
 
     @Test
     public void test1() {
@@ -18,7 +18,7 @@ public void test1() {
         head.next.next.next = new ListNode(3);
         head.next.next.next.next = new ListNode(3);
 
-        RemoveDuplicatesfromSortedList test = new RemoveDuplicatesfromSortedList();
+        _83 test = new _83();
 
         ListNode expected = new ListNode(1);
         expected.next = new ListNode(2);
