g0001_0100.s0031_next_permutation.readme.md Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java17 Show documentation
Show all versions of leetcode-in-java17 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
31\. Next Permutation
Medium
Implement **next permutation**, which rearranges numbers into the lexicographically next greater permutation of numbers.
If such an arrangement is not possible, it must rearrange it as the lowest possible order (i.e., sorted in ascending order).
The replacement must be **[in place](http://en.wikipedia.org/wiki/In-place_algorithm)** and use only constant extra memory.
**Example 1:**
**Input:** nums = [1,2,3]
**Output:** [1,3,2]
**Example 2:**
**Input:** nums = [3,2,1]
**Output:** [1,2,3]
**Example 3:**
**Input:** nums = [1,1,5]
**Output:** [1,5,1]
**Example 4:**
**Input:** nums = [1]
**Output:** [1]
**Constraints:**
* `1 <= nums.length <= 100`
* `0 <= nums[i] <= 100`