leetcode 31 next permutation

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, do not allocate extra memory.

Here are some examples. Inputs are in the left-hand column and its corresponding outputs are in the right-hand column.
1,2,3 → 1,3,2
3,2,1 → 1,2,3
1,1,5 → 1,5,1

class Solution {
public:
    typedef vector<int>::size_type sz;

    void nextPermutation(vector<int>& nums) {
        sz size = nums.size();

        for (sz i = size - 1; i != 0; --i) {

            // 当第i-1个数小于i时需要对i-1进行调整
            if (nums[i] > nums[i - 1]) {

                // 从末尾开始找大于nums[i - 1]的最小的数
                for (sz j = size - 1; j != i - 1; --j) {
                    if (nums[i - 1] < nums[j]) {
                        swap(nums[i - 1], nums[j]);

                        reverse(nums, i, size);
                        return;
                    }
                }
            }
        }

        reverse(nums, 0, size);
        return;
    }

private:
    void swap(int& a, int& b) {
        a = a + b;
        b = a - b;
        a = a - b;
    }

    // [b, e)
    void reverse(vector<int>& nums, sz b, sz e) {
        for (sz i = 0; i < (e - b) / 2; ++i) {
            swap(nums[b + i], nums[e - 1 - i]);
        }
    }

};

hehe

class Solution {  
public:  
    void nextPermutation(vector<int>& nums) {  
        next_permutation(nums.begin(), nums.end()); //STL  
    }  
};