Skip to content

Commit 0ad37ed

Browse files
authored
Improved tasks 61, 82
1 parent 1c43a61 commit 0ad37ed

File tree

6 files changed

+15
-19
lines changed

6 files changed

+15
-19
lines changed

src/main/go/com_github_leetcode/list_node/list_node.go renamed to src/main/go/g0001_0100/s0061_rotate_list/list_node.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
package list_node
1+
package s0061_rotate_list
22

33
type ListNode struct {
44
Val int

src/main/go/g0001_0100/s0061_rotate_list/solution.go

+2-6
Original file line numberDiff line numberDiff line change
@@ -3,18 +3,14 @@ package s0061_rotate_list
33
// #Medium #Two_Pointers #Linked_List #Programming_Skills_II_Day_16 #Udemy_Linked_List
44
// #Top_Interview_150_Linked_List #2025_03_04_Time_0_ms_(100.00%)_Space_42.42_MB_(78.37%)
55

6-
import (
7-
"github.com/LeetCode-in-Go/LeetCode-in-Go/src/main/go/com_github_leetcode/list_node"
8-
)
9-
106
/**
117
* Definition for singly-linked list.
128
* type ListNode struct {
139
* Val int
1410
* Next *ListNode
1511
* }
1612
*/
17-
func rotateRight(head *list_node.ListNode, k int) *list_node.ListNode {
13+
func rotateRight(head *ListNode, k int) *ListNode {
1814
if head == nil || k == 0 {
1915
return head
2016
}
@@ -32,7 +28,7 @@ func rotateRight(head *list_node.ListNode, k int) *list_node.ListNode {
3228
for i := 1; i <= count-times-1 && temp != nil; i++ {
3329
temp = temp.Next
3430
}
35-
var newHead *list_node.ListNode
31+
var newHead *ListNode
3632
if temp != nil && tail != nil {
3733
newHead = temp.Next
3834
temp.Next = nil

src/main/go/g0001_0100/s0061_rotate_list/solution_test.go

+2-3
Original file line numberDiff line numberDiff line change
@@ -3,12 +3,11 @@ package s0061_rotate_list
33
import (
44
"testing"
55

6-
"github.com/LeetCode-in-Go/LeetCode-in-Go/src/main/go/com_github_leetcode/list_node"
76
"github.com/stretchr/testify/assert"
87
)
98

109
func TestRotateRight(t *testing.T) {
11-
head := &list_node.ListNode{Val: 1, Next: &list_node.ListNode{Val: 2, Next: &list_node.ListNode{Val: 3, Next: &list_node.ListNode{Val: 4, Next: &list_node.ListNode{Val: 5}}}}}
10+
head := &ListNode{Val: 1, Next: &ListNode{Val: 2, Next: &ListNode{Val: 3, Next: &ListNode{Val: 4, Next: &ListNode{Val: 5}}}}}
1211
result := rotateRight(head, 2)
1312
assert.Equal(t, 4, result.Val)
1413
assert.Equal(t, 5, result.Next.Val)
@@ -18,7 +17,7 @@ func TestRotateRight(t *testing.T) {
1817
}
1918

2019
func TestRotateRight2(t *testing.T) {
21-
head := &list_node.ListNode{Val: 0, Next: &list_node.ListNode{Val: 1, Next: &list_node.ListNode{Val: 2}}}
20+
head := &ListNode{Val: 0, Next: &ListNode{Val: 1, Next: &ListNode{Val: 2}}}
2221
result := rotateRight(head, 4)
2322
assert.Equal(t, 2, result.Val)
2423
assert.Equal(t, 0, result.Next.Val)
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,6 @@
1+
package s0082_remove_duplicates_from_sorted_list_ii
2+
3+
type ListNode struct {
4+
Val int
5+
Next *ListNode
6+
}

src/main/go/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/solution.go

+2-6
Original file line numberDiff line numberDiff line change
@@ -4,15 +4,11 @@ package s0082_remove_duplicates_from_sorted_list_ii
44
// #Algorithm_II_Day_3_Two_Pointers #Top_Interview_150_Linked_List
55
// #2025_05_14_Time_0_ms_(100.00%)_Space_4.75_MB_(70.34%)
66

7-
import (
8-
"github.com/LeetCode-in-Go/LeetCode-in-Go/src/main/go/com_github_leetcode/list_node"
9-
)
10-
11-
func deleteDuplicates(head *list_node.ListNode) *list_node.ListNode {
7+
func deleteDuplicates(head *ListNode) *ListNode {
128
if head == nil || head.Next == nil {
139
return head
1410
}
15-
dummy := &list_node.ListNode{Val: 0}
11+
dummy := &ListNode{Val: 0}
1612
prev := dummy
1713
prev.Next = head
1814
curr := head.Next

src/main/go/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/solution_test.go

+2-3
Original file line numberDiff line numberDiff line change
@@ -3,20 +3,19 @@ package s0082_remove_duplicates_from_sorted_list_ii
33
import (
44
"testing"
55

6-
"github.com/LeetCode-in-Go/LeetCode-in-Go/src/main/go/com_github_leetcode/list_node"
76
"github.com/stretchr/testify/assert"
87
)
98

109
func TestDeleteDuplicates(t *testing.T) {
11-
head := &list_node.ListNode{Val: 1, Next: &list_node.ListNode{Val: 2, Next: &list_node.ListNode{Val: 3, Next: &list_node.ListNode{Val: 3, Next: &list_node.ListNode{Val: 4, Next: &list_node.ListNode{Val: 4, Next: &list_node.ListNode{Val: 5}}}}}}}
10+
head := &ListNode{Val: 1, Next: &ListNode{Val: 2, Next: &ListNode{Val: 3, Next: &ListNode{Val: 3, Next: &ListNode{Val: 4, Next: &ListNode{Val: 4, Next: &ListNode{Val: 5}}}}}}}
1211
result := deleteDuplicates(head)
1312
assert.Equal(t, 1, result.Val)
1413
assert.Equal(t, 2, result.Next.Val)
1514
assert.Equal(t, 5, result.Next.Next.Val)
1615
}
1716

1817
func TestDeleteDuplicates2(t *testing.T) {
19-
head := &list_node.ListNode{Val: 1, Next: &list_node.ListNode{Val: 1, Next: &list_node.ListNode{Val: 1, Next: &list_node.ListNode{Val: 2, Next: &list_node.ListNode{Val: 3}}}}}
18+
head := &ListNode{Val: 1, Next: &ListNode{Val: 1, Next: &ListNode{Val: 1, Next: &ListNode{Val: 2, Next: &ListNode{Val: 3}}}}}
2019
result := deleteDuplicates(head)
2120
assert.Equal(t, 2, result.Val)
2221
assert.Equal(t, 3, result.Next.Val)

0 commit comments

Comments
 (0)