Next Permutation LeetCode solution in C++

1
class Solution {
2
 public:
3
  void nextPermutation(vector<int> &nums) {
4
    if (nums.size() == 1) return;
5

6
    int i = nums.size() - 2;
7
    while (i >= 0 && nums[i] >= nums[i + 1]) i--;
8
    if (i >= 0) {
9
      int j = nums.size() - 1;
10
      while (nums[i] >= nums[j]) j--;
11
      swap(nums[j], nums[i]);
12
    }
13
    sort(nums.begin() + i + 1, nums.end());
14
  }
15
};