[leetcode 52] Next Permutation Report

 class Solution {
 public:
     /**
      * @param nums: An array of integers
      * @return: An array of integers that‘s next permuation
      */
     vector<int> nextPermutation(vector<int> &nums) {
         // write your code here
         if (nums.size() <= 1) {
             return nums;
         }
         
         //find first element that is smaller that next element
         int first_small_index = -1;
         for (int i = nums.size() - 2; i >= 0; --i) {
             if (nums[i] < nums[i+1]) {
                 first_small_index = i;
                 break;
             }
         }
         //find the first element that is just bigger than the element we found
         if (first_small_index != -1) {
             int first_bigger_index = first_small_index;
             for (int i = first_small_index + 1; i < nums.size(); ++i) {
                 if (nums[i] > nums[first_small_index]) {
                     first_bigger_index = i;
                 } else {
                     break;
                 }
             }
             swap(nums[first_small_index], nums[first_bigger_index]);
         }
         // Reverse rest array
         reverse(nums.begin() + first_small_index + 1, nums.end());
         
         return nums;
     }
 };