Commit f6d0ae3

authored

recursive solution for 203 (keep-practicing#69)

1 parent b95f9e9 commit f6d0ae3Copy full SHA for f6d0ae3

File tree

+24

-0

lines changed

+24

-0

lines changed

Lines changed: 14 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -31,3 +31,17 @@ func removeElements(head ListNode, val int) ListNode {`
`31`	`31`	`}`
`32`	`32`	`return dummyHead.Next`
`33`	`33`	`}`
	`34`	`+`
	`35`	`+// recursive`
	`36`	`+// time complexity: O(n)`
	`37`	`+// space complexity: O(n)`
	`38`	`+func removeElements1(head ListNode, val int) ListNode {`
	`39`	`+ if head == nil {`
	`40`	`+ return head`
	`41`	`+ }`
	`42`	`+ head.Next = removeElements1(head.Next, val)`
	`43`	`+ if head.Val == val {`
	`44`	`+ return head.Next`
	`45`	`+ }`
	`46`	`+ return head`
	`47`	`+}`

Lines changed: 10 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -15,6 +15,16 @@ func TestRemoveElements(t *testing.T) {`
`15`	`15`	`}`
`16`	`16`	`}`
`17`	`17`
	`18`	`+func TestRemoveElements1(t *testing.T) {`
	`19`	`+ head := createSinglyLinkedList([]int{1, 2, 6, 3, 4, 5, 6})`
	`20`	`+ val := 6`
	`21`	`+ expected := createSinglyLinkedList([]int{1, 2, 3, 4, 5})`
	`22`	`+`
	`23`	`+ if res := removeElements1(head, val); !reflect.DeepEqual(res, expected) {`
	`24`	`+ t.Errorf("expected %v, got %v", expected, res)`
	`25`	`+ }`
	`26`	`+}`
	`27`	`+`
`18`	`28`	`func createSinglyLinkedList(nums []int) *ListNode {`
`19`	`29`	`head := &ListNode{}`
`20`	`30`	`cur := head`

Comments

(0)