Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

leetcode89格雷编码 | 算法加油站 #11

Open
zuodexin opened this issue Oct 30, 2022 · 0 comments
Open

leetcode89格雷编码 | 算法加油站 #11

zuodexin opened this issue Oct 30, 2022 · 0 comments
Labels
21a2e8110d0de79abfa274f5417591ee Gitalk

Comments

@zuodexin
Copy link
Owner

https://zuodexin.github.io/2022/01/08/leetcode89%E6%A0%BC%E9%9B%B7%E7%BC%96%E7%A0%81/

用dfs做复杂度是$O((n-1)!)$,在超时的边缘徘徊12345678910111213141516171819202122232425262728293031323334353637class Solution {public: vector grayCode(int n) { vector seq&#123
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
21a2e8110d0de79abfa274f5417591ee Gitalk
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@zuodexin