排列
文章平均质量分 76
jmspan
这个作者很懒,什么都没留下…
展开
-
LeetCode 241. Different Ways to Add Parentheses(加括号的不同方法)
原题网址:https://leetcode.com/problems/different-ways-to-add-parentheses/ Given a string of numbers and operators, return all possible results from computing all the different possible ways to group原创 2016-04-07 02:58:28 · 763 阅读 · 0 评论 -
LeetCode 22. Generate Parentheses(生成括号)
原题网址:https://leetcode.com/problems/generate-parentheses/ Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a sol原创 2016-05-19 07:18:56 · 652 阅读 · 0 评论 -
LeetCode 60. Permutation Sequence(排列序列)
原题网址:https://leetcode.com/problems/permutation-sequence/ The set [1,2,3,…,n] contains a total of n! unique permutations. By listing and labeling all of the permutations in order, We get the原创 2016-05-21 09:05:38 · 765 阅读 · 0 评论 -
LeetCode 47. Permutations II(排列)
原题网址:https://leetcode.com/problems/permutations-ii/ Given a collection of numbers that might contain duplicates, return all possible unique permutations. For example, [1,1,2] have the followi原创 2016-05-21 05:23:53 · 632 阅读 · 0 评论 -
LeetCode 46. Permutations(排列)
原题网址:https://leetcode.com/problems/permutations/ Given a collection of distinct numbers, return all possible permutations. For example, [1,2,3] have the following permutations: [1,2,3], [1,3原创 2016-05-21 04:49:55 · 343 阅读 · 0 评论 -
LeetCode 31. Next Permutation(下一个排列)
原题网址:https://leetcode.com/problems/next-permutation/ Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is原创 2016-05-20 10:36:39 · 400 阅读 · 0 评论 -
LeetCode 321. Create Maximum Number(寻找最大数)
原题网址:https://leetcode.com/problems/create-maximum-number/ Given two arrays of length m and n with digits 0-9 representing two numbers. Create the maximum number of length k from digits of th原创 2016-04-25 02:00:54 · 1943 阅读 · 0 评论 -
LeetCode 314. Binary Tree Vertical Order Traversal(二叉树垂直遍历)
原题网址:https://leetcode.com/problems/binary-tree-vertical-order-traversal/ Given a binary tree, return the vertical order traversal of its nodes' values. (ie, from top to bottom, column by column).原创 2016-04-22 02:19:07 · 5960 阅读 · 0 评论 -
LeetCode 179. Largest Number(最大数)
原题网址:https://leetcode.com/problems/largest-number/ Given a list of non negative integers, arrange them such that they form the largest number. For example, given [3, 30, 34, 5, 9], the largest原创 2016-05-25 01:36:20 · 1820 阅读 · 0 评论 -
LeetCode 267. Palindrome Permutation II(对称排列)
原题网址:https://leetcode.com/problems/palindrome-permutation-ii/ Given a string s, return all the palindromic permutations (without duplicates) of it. Return an empty list if no palindromic permut原创 2016-04-11 01:17:09 · 811 阅读 · 0 评论 -
LeetCode 357. Count Numbers with Unique Digits(计算无重复数字)
原题网址:https://leetcode.com/problems/count-numbers-with-unique-digits/ Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x n. Example: Given n = 2, return 91. (原创 2016-06-15 02:04:36 · 1354 阅读 · 0 评论