Reference: LeetCode

Difficulty: Medium

## Problem

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 replacement must be

`in-place`

and use only constant extra memory.

Here are some examples. Inputs are in the left-hand column and its corresponding outputs are in the right-hand column.

**Example:**

1 | 1,2,3 → 1,3,2 |

## Analysis

### Brute-Force

Generate every possible permutation and do comparison.

**Time:** $O(N!)$**Space:** $O(N)$

### Single Pass

**Note:** This problem is good for index manipulation practice.

Idea: LeetCode Solution

Try these examples:

1 | public void nextPermutation(int[] nums) { |

**Time:** $O(N)$**Space:** $O(1)$