Commit 206e7df

committed

Add: Delete Node in a Linked List

1 parent c24763a commit 206e7dfCopy full SHA for 206e7df

File tree

+56

-0

lines changed

+56

-0

lines changed

Lines changed: 16 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1 +1,17 @@`
`1`	`1`	`package delete_node_in_a_linked_list`
	`2`	`+`
	`3`	`+import . "github.com/openset/leetcode/internal/kit"`
	`4`	`+`
	`5`	`+/**`
	`6`	`+ * Definition for singly-linked list.`
	`7`	`+ * type ListNode struct {`
	`8`	`+ * Val int`
	`9`	`+ * Next *ListNode`
	`10`	`+ * }`
	`11`	`+ */`
	`12`	`+func deleteNode(node *ListNode) {`
	`13`	`+ if node != nil && node.Next != nil {`
	`14`	`+ node.Val = node.Next.Val`
	`15`	`+ node.Next = node.Next.Next`
	`16`	`+ }`
	`17`	`+}`

Lines changed: 40 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1 +1,41 @@`
`1`	`1`	`package delete_node_in_a_linked_list`
	`2`	`+`
	`3`	`+import (`
	`4`	`+ "reflect"`
	`5`	`+ "testing"`
	`6`	`+`
	`7`	`+ . "github.com/openset/leetcode/internal/kit"`
	`8`	`+)`
	`9`	`+`
	`10`	`+type caseType struct {`
	`11`	`+ input []int`
	`12`	`+ node int`
	`13`	`+ expected []int`
	`14`	`+}`
	`15`	`+`
	`16`	`+func TestDeleteNode(t *testing.T) {`
	`17`	`+ tests := [...]caseType{`
	`18`	`+ {`
	`19`	`+ input: []int{4, 5, 1, 9},`
	`20`	`+ node: 5,`
	`21`	`+ expected: []int{4, 1, 9},`
	`22`	`+ },`
	`23`	`+ {`
	`24`	`+ input: []int{4, 5, 1, 9},`
	`25`	`+ node: 1,`
	`26`	`+ expected: []int{4, 5, 9},`
	`27`	`+ },`
	`28`	`+ }`
	`29`	`+ for _, tc := range tests {`
	`30`	`+ head := SliceInt2ListNode(tc.input)`
	`31`	`+ node := head`
	`32`	`+ for node.Val != tc.node {`
	`33`	`+ node = node.Next`
	`34`	`+ }`
	`35`	`+ deleteNode(node)`
	`36`	`+ output := ListNode2SliceInt(head)`
	`37`	`+ if !reflect.DeepEqual(output, tc.expected) {`
	`38`	`+ t.Fatalf("input: %v, output: %v, expected: %v", tc.input, output, tc.expected)`
	`39`	`+ }`
	`40`	`+ }`
	`41`	`+}`

Comments

(0)