Commit 1e6b228

authored

Update Construct the Lexicographically Largest Valid Sequence

1 parent 4a56950 commit 1e6b228Copy full SHA for 1e6b228

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -4,7 +4,7 @@`
`4`	`4`	`Time Complexity : O(n!) for there are n! possible sequence`
`5`	`5`	`(or you can think as the first digit has n candidates , second digit has n - 1 ... to the last digit , total complexity is`
`6`	`6`	`n * (n - 1) * (n - 2) ... * 1 = O(n!) )`
`7`		`-Space Complexity : O(n! for the recursion (recursion depth = O(n))`
	`7`	`+Space Complexity : O(n!) for the recursion (recursion depth = O(n))`
`8`	`8`
`9`	`9`	`實務上運算找到解的速度會比複雜度快上許多,因為設定上只要一找到解就可以回傳(題目保證一定有解);同時因為有許多不可能的狀態已經被剪枝,進一步加快速度`
`10`	`10`

Comments

(0)