题目描述：
Given a collection of distinct numbers, return all possible permutations.
For example,
[1,2,3] have the following permutations:
[ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2 ...
归档 2016
[LeetCode]Permutations
[LeetCode]Next Permutation
作者是
发布于
在
LeetCode.
题目描述：
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.
If such arrangement is not possible, it must rearrange it as the lowest possible order (ie, sorted in ascending order).
The ...
LeetCode Weekly Contest 3解题报告
作者是
发布于
在
LeetCode.
LeetCode Weekly Contest 3是LeetCode举办的第二场正式周赛，共4道题目，比赛时长2.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-3/
题解列表：
LeetCode 393. UTF-8 Validation
LeetCode 395. Longest Substring with At Least K Repeating Characters
[LeetCode]Longest Substring with At Least K Repeating Characters
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 395. Longest Substring with At Least K Repeating Characters
Find the length of the longest substring T of a given string (consists of lowercase letters only) such that every character in T appears no less than k times ...
[LeetCode]Decode String
作者是
发布于
在
LeetCode.
题目描述：
Given an encoded string, return it's decoded string.
The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times. Note that k is guaranteed to be a ...