摘要：
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. Example: 思路：回溯 阅读全文
posted @ 2019-09-18 17:24
琴影
阅读(180)
评论(0)
推荐(0)
摘要：
Given a collection of distinct integers, return all possible permutations. Example: 思路一：二话不说，经典题， 回溯。 思路二： 阅读全文
posted @ 2019-09-18 16:35
琴影
阅读(204)
评论(0)
推荐(0)
摘要：
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possib 阅读全文
posted @ 2019-09-18 16:02
琴影
阅读(191)
评论(0)
推荐(0)
摘要：
You need to construct a string consists of parenthesis and integers from a binary tree with the preorder traversing way. The null node needs to be rep 阅读全文
posted @ 2019-09-18 09:10
琴影
阅读(188)
评论(0)
推荐(0)
浙公网安备 33010602011771号