Commit dc18b44

authored

Update Construct the Lexicographically Largest Valid Sequence

1 parent 50a2a48 commit dc18b44Copy full SHA for dc18b44

File tree

-0

lines changed

-0

lines changed

Lines changed: 2 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -6,6 +6,8 @@ Time Complexity : O(n!) for there are n! possible sequence`
`6`	`6`	`n * (n - 1) * (n - 2) ... * 1 = O(n!) )`
`7`	`7`	`Space Complexity : O(n! for the recursion (recursion depth = O(n))`
`8`	`8`
	`9`	`+實務上運算找到解的速度會比複雜度快上許多,因為設定上只要一找到解就可以回傳(同時題目保證一定有解)`
	`10`	`+`
`9`	`11`	`class Solution {`
`10`	`12`	`public:`
`11`	`13`	`vector<int> ans , appear ;`

Comments

(0)