feat: commit solution 83

Author: lxlxw

_sidebar.md

@@ -19,7 +19,8 @@
   - [28.实现 strStr() ✅](solution/1-99/0028.implement-strstr/)
   - [35.搜索插入位置 ✅](solution/1-99/0035.search-insert-position/)
   - [66.加一 ✅](solution/1-99/0066.plus-one/)
-  - [88.合并两个有序数组](solution/1-99/0088.merge-sorted-array/)
+  - [83.删除排序链表中的重复元素 ✅](solution/1-99/0083.remove-duplicates-from-sorted-list/)
+  - [88.合并两个有序数组 ✅](solution/1-99/0088.merge-sorted-array/)
   - [125.验证回文串 ✅](solution/100-199/0125.valid-palindrome/)
 
 

index-tags.md

@@ -59,6 +59,7 @@
 |  题号  |  题解  |  标签  | 难度  | 是否解题 |
 | --- | --- | --- | --- | --- |
 |  [21](https://leetcode-cn.com/problems/merge-two-sorted-lists)  |  [合并两个有序链表](/solution/1-99/0021.merge-two-sorted-lists/)  |  `链表`  |  <font color=green>简单</font>  |✅ |
+|  [83](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list)  |  [删除排序链表中的重复元素](/solution/1-99/0083.remove-duplicates-from-sorted-list/)  |  `链表`  |  <font color=green>简单</font>  |✅ |
 
 #### **二分查找**
 

index-type.md

@@ -25,7 +25,7 @@
 |  [67](https://leetcode-cn.com/problems/add-binary)  |  [二进制求和](/solution/1-99/0067.add-binary/)  |  `数学`,`字符串`  |  <font color=green>简单</font>  |
 |  [69](https://leetcode-cn.com/problems/sqrtx)  |  [x 的平方根](/solution/1-99/0069.sqrt%28x%29/)  |  `数学`,`二分查找`  |  <font color=green>简单</font>  |
 |  [70](https://leetcode-cn.com/problems/climbing-stairs)  |  [爬楼梯](/solution/1-99/0070.climbing-stairs/)  |  `动态规划`  |  <font color=green>简单</font>  |
-|  [83](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list)  |  [删除排序链表中的重复元素](/solution/1-99/0083.remove-duplicates-from-sorted-list/)  |  `链表`  |  <font color=green>简单</font>  |
+|  [83](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list)  |  [删除排序链表中的重复元素](/solution/1-99/0083.remove-duplicates-from-sorted-list/)  |  `链表`  |  <font color=green>简单</font>  |✅ |
 |  [88](https://leetcode-cn.com/problems/merge-sorted-array)  |  [合并两个有序数组](/solution/1-99/0088.merge-sorted-array/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
 |  [100](https://leetcode-cn.com/problems/same-tree)  |  [相同的树](/solution/100-199/0100.same-tree/)  |  `树`,`深度优先搜索`  |  <font color=green>简单</font>  |
 |  [101](https://leetcode-cn.com/problems/symmetric-tree)  |  [对称二叉树](/solution/100-199/0101.symmetric-tree/)  |  `树`,`深度优先搜索`,`广度优先搜索`  |  <font color=green>简单</font>  |

solution/1-99/0083.remove-duplicates-from-sorted-list/README.md

@@ -0,0 +1,54 @@
+# [83.删除排序链表中的重复元素](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list/)
+
+
+### 题目描述
+
+<div class="notranslate"><p>给定一个排序链表，删除所有重复的元素，使得每个元素只出现一次。</p>
+
+<p><strong>示例&nbsp;1:</strong></p>
+
+<pre><strong>输入:</strong> 1-&gt;1-&gt;2
+<strong>输出:</strong> 1-&gt;2
+</pre>
+
+<p><strong>示例&nbsp;2:</strong></p>
+
+<pre><strong>输入:</strong> 1-&gt;1-&gt;2-&gt;3-&gt;3
+<strong>输出:</strong> 1-&gt;2-&gt;3</pre>
+</div>
+
+### 解题思路
+
+1. 当前节点的下一个指针不为空时，判断当前节点的值跟下一个指针节点的值是否相等。
+2. 如果相等，则将下下个节点的指针指向当前节点的下一个指针。
+3. 如果不相等，则指针往前移。
+
+### 代码实现
+
+<!-- tabs:start -->
+
+#### **Golang**
+```go
+type ListNode struct {
+	Val  int
+	Next *ListNode
+}
+
+func deleteDuplicates(head *ListNode) *ListNode {
+	if head == nil {
+		return nil
+	}
+	ret := head
+	for head.Next != nil {
+		if head.Val == head.Next.Val {
+			head.Next = head.Next.Next
+			continue
+		}
+		head = head.Next
+	}
+	return ret
+}
+```
+
+
+<!-- tabs:end -->

solution/1-99/0083.remove-duplicates-from-sorted-list/solution.go

@@ -0,0 +1,37 @@
+package leetcode
+
+/*
+ * @lc app=leetcode.cn id=83 lang=golang
+ *
+ * [83] 删除排序链表中的重复元素
+ */
+
+type ListNode struct {
+	Val  int
+	Next *ListNode
+}
+
+// @lc code=start
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ *     Val int
+ *     Next *ListNode
+ * }
+ */
+func deleteDuplicates(head *ListNode) *ListNode {
+	if head == nil {
+		return nil
+	}
+	ret := head
+	for head.Next != nil {
+		if head.Val == head.Next.Val {
+			head.Next = head.Next.Next
+			continue
+		}
+		head = head.Next
+	}
+	return ret
+}
+
+// @lc code=end

solution/1-99/0083.remove-duplicates-from-sorted-list/solution_test.go

@@ -0,0 +1,76 @@
+package leetcode
+
+import (
+	"fmt"
+	"testing"
+)
+
+func TestDeleteDuplicates(t *testing.T) {
+	t.Run("Test-1", func(t *testing.T) {
+		data1 := []int{1, 1, 2}
+		got := deleteDuplicates(MakeListNote(data1))
+		want := MakeListNote([]int{1, 2})
+
+		if !Equal(got, want) {
+			fmt.Print("GOT:")
+			PrintList(got)
+			fmt.Print("WANT:")
+			PrintList(want)
+			t.Error("GOT:", got, "WANT:", want)
+		}
+	})
+
+	t.Run("Test-2", func(t *testing.T) {
+		got := deleteDuplicates(&ListNode{})
+		want := &ListNode{}
+		if !Equal(got, want) {
+			fmt.Print("GOT:")
+			PrintList(got)
+			fmt.Print("WANT:")
+			PrintList(want)
+			t.Error("GOT:", got, "WANT:", want)
+		}
+	})
+}
+
+func Equal(x, y *ListNode) bool {
+	for x == nil || y == nil {
+		if x == nil && y != nil {
+			fmt.Println(x, y)
+			return false
+		}
+		if x != nil && y == nil {
+			fmt.Println(x, y)
+			return false
+		}
+
+		if x.Val != y.Val {
+			fmt.Println(x, y)
+			return false
+		}
+		x = x.Next
+		y = y.Next
+	}
+	return true
+}
+
+func PrintList(x *ListNode) {
+	for x != nil {
+		fmt.Print(x.Val, " ")
+		x = x.Next
+	}
+	fmt.Println()
+}
+
+func MakeListNote(x []int) *ListNode {
+	list := &ListNode{}
+	head := list
+
+	list.Val = x[0]
+	for i := 1; i < len(x); i++ {
+		list.Next = &ListNode{}
+		list = list.Next
+		list.Val = x[i]
+	}
+	return head
+}