feat: add the solution of Remove Duplicates from Sorted List(083) with kotlin.

Author: relish-wang

README.md

@@ -45,7 +45,7 @@
 | [067][067-question] | [Add Binary][067-tips]                                       | [✅][067-java] |              | [✅][067-kotlin] |
 | [069][069-question] | [Sqrt(x)][069-tips]                                          | [✅][069-java] |              | [✅][069-kotlin] |
 | [070][070-question] | [Climbing Stairs][070-tips]                                  | [✅][070-java] |              | [✅][070-kotlin] |
-| [083][083-question] | [Remove Duplicates from Sorted List][083-tips]               | [✅][083-java] |              |                  |
+| [083][083-question] | [Remove Duplicates from Sorted List][083-tips]               | [✅][083-java] |              | [✅][083-kotlin] |
 | [088][088-question] | [Merge Sorted Array][088-tips]                               | [✅][088-java] |              |                  |
 | [100][100-question] | [Same Tree][100-tips]                                        | [✅][100-java] |              |                  |
 | [101][101-question] | [Symmetric Tree][101-tips]                                   | [✅][101-java] |              |                  |
@@ -489,4 +489,5 @@
 [067-kotlin]: ./src/_067/kotlin/Solution.kt
 [069-kotlin]: ./src/_069/kotlin/Solution.kt
 [070-kotlin]: ./src/_070/kotlin/Solution.kt
+[083-kotlin]: ./src/_083/kotlin/Solution.kt
 [771-kotlin]: ./src/_771/kotlin/Solution.kt

src/_083/kotlin/Solution.kt

@@ -0,0 +1,41 @@
+package _083.kotlin
+
+import structure.ListNode
+
+/**
+ * @author relish
+ * @since 2018/04/23
+ */
+/**
+ * Definition for singly-linked list.
+ * class ListNode(var `val`: Int = 0) {
+ *     var next: ListNode? = null
+ * }
+ */
+class Solution {
+    fun deleteDuplicates(head: ListNode?): ListNode? {
+        if (head == null) return head
+        var cur = head
+        while (cur!!.next != null) {
+            if (cur.`val` == cur.next.`val`) {
+                cur.next = cur.next.next
+            } else {
+                cur = cur.next
+            }
+        }
+        return head
+    }
+}
+
+fun main(args: Array<String>) {
+    val n = ListNode(1)
+    n.next = ListNode(1)
+    n.next.next = ListNode(2)
+    n.next.next.next = ListNode(3)
+    n.next.next.next.next = ListNode(3)
+    var listNode = Solution().deleteDuplicates(n)
+    while (listNode != null) {
+        println(listNode.`val`)
+        listNode = listNode.next
+    }
+}

tips/083/README.md

@@ -17,6 +17,7 @@ Given `1->1->2->3->3`, return `1->2->3`.
 
 题意是删除链表中重复的元素，很简单，我们只需要遍历一遍链表，遇到链表中相邻元素相同时，把当前指针指向下下个元素即可。
 
+Java:
 ```java
 /**
  * Definition for singly-linked list.
@@ -42,6 +43,24 @@ class Solution {
 }
 ```
 
+kotlin(224ms/100.00%)
+```kotlin
+class Solution {
+    fun deleteDuplicates(head: ListNode?): ListNode? {
+        if (head == null) return head
+        var cur = head
+        while (cur!!.next != null) {
+            if (cur.`val` == cur.next.`val`) {
+                cur.next = cur.next.next
+            } else {
+                cur = cur.next
+            }
+        }
+        return head
+    }
+}
+```
+
 
 ## 结语