Commit 0b5b08f

committed

Update README.md

1 parent f4c1205 commit 0b5b08fCopy full SHA for 0b5b08f

File tree

-4

lines changed

-4

lines changed

Lines changed: 4 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -39,8 +39,8 @@ public:`
`39`	`39`
`40`	`40`	`Complexity analysis`
`41`	`41`
`42`		`-- Time complexity : O(n)O(n). Assume that nn is the list's length, the time complexity is O(n)O(n).`
`43`		`-- Space complexity : O(1)O(1).`
	`42`	`+- Time complexity : O(n). Assume that nn is the list's length, the time complexity is O(n).`
	`43`	`+- Space complexity : O(1).`
`44`	`44`
`45`	`45`	`#### Approach #2 (Recursive) [Accepted]`
`46`	`46`
`@@ -73,8 +73,8 @@ public:`
`73`	`73`
`74`	`74`	`Complexity analysis`
`75`	`75`
`76`		`-- Time complexity : O(n)O(n). Assume that nn is the list's length, the time complexity is O(n)O(n).`
`77`		`-- Space complexity : O(n)O(n). The extra space comes from implicit stack space due to recursion. The recursion could go up to nn levels deep.`
	`76`	`+- Time complexity : O(n). Assume that nn is the list's length, the time complexity is O(n).`
	`77`	`+- Space complexity : O(n). The extra space comes from implicit stack space due to recursion. The recursion could go up to nn levels deep.`
`78`	`78`
`79`	`79`
`80`	`80`

Comments

(0)