Merge pull request #391 from openset/develop

Add: Delete Node in a Linked List

Author: Shuo

problems/delete-node-in-a-linked-list/delete_node_in_a_linked_list.go

@@ -1 +1,17 @@
 package delete_node_in_a_linked_list
+
+import . "github.com/openset/leetcode/internal/kit"
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ *     Val int
+ *     Next *ListNode
+ * }
+ */
+func deleteNode(node *ListNode) {
+	if node != nil && node.Next != nil {
+		node.Val = node.Next.Val
+		node.Next = node.Next.Next
+	}
+}

problems/delete-node-in-a-linked-list/delete_node_in_a_linked_list_test.go

@@ -1 +1,56 @@
 package delete_node_in_a_linked_list
+
+import (
+	"reflect"
+	"testing"
+
+	. "github.com/openset/leetcode/internal/kit"
+)
+
+type caseType struct {
+	input    []int
+	node     int
+	expected []int
+}
+
+func TestDeleteNode(t *testing.T) {
+	tests := [...]caseType{
+		{
+			input:    []int{4, 5, 1, 9},
+			node:     5,
+			expected: []int{4, 1, 9},
+		},
+		{
+			input:    []int{4, 5, 1, 9},
+			node:     1,
+			expected: []int{4, 5, 9},
+		},
+		{
+			input:    []int{4, 5, 1, 9},
+			node:     4,
+			expected: []int{5, 1, 9},
+		},
+		{
+			input:    []int{4, 5, 1, 9},
+			node:     9,
+			expected: []int{4, 5, 1, 9},
+		},
+		{
+			input:    []int{4, 5, 1, 9},
+			node:     2,
+			expected: []int{4, 5, 1, 9},
+		},
+	}
+	for _, tc := range tests {
+		head := SliceInt2ListNode(tc.input)
+		node := head
+		for node != nil && node.Val != tc.node {
+			node = node.Next
+		}
+		deleteNode(node)
+		output := ListNode2SliceInt(head)
+		if !reflect.DeepEqual(output, tc.expected) {
+			t.Fatalf("input: %v, output: %v, expected: %v", tc.input, output, tc.expected)
+		}
+	}
+}