C++Leetcode--31. 下一个排列

class Solution {
public:
void nextPermutation(vector<int>& nums) {
	if (nums.size() <= 0)return;
	for (int i = nums.size() - 2; i >= 0; --i)
	{
		if (nums[i] < nums[i+1])
		{
			auto pos = i + 1;
			auto j = nums.size() - 1;
			while (pos < j)swap(nums[pos++], nums[j--]);
			pos = i + 1;
			while (pos < nums.size() && nums[i] >= nums[pos])pos++;
			swap(nums[i], nums[pos]);
			return;
		}
	}
	int i = 0, j = nums.size() - 1;
	while (i < j)swap(nums[i++], nums[j--]);
}
};