LeetCode-31-Next Permutation 贪心，排序

a.sort()

t=sorted(a)

class Solution(object):
    def nextPermutation(self, nums):
        """
        :type nums: List[int]
        :rtype: void Do not return anything, modify nums in-place instead.
        """
        Len=len(nums)
        if Len<=1:
            return
        v=nums[Len-1]
        flag=0
        for i in range(Len-2,-1,-1):
            if(nums[i]<nums[i+1]):
                flag=1
                MIN=0x7fffffff
                p=-1
                for j in range(i+1,Len):
                    if(nums[j]>nums[i]):
                        MIN=nums[j];
                        p=j
                    else:break
                nums[p],nums[i]=nums[i],nums[p]
                #swap
                nums[i+1:].sort()
                t=sorted(nums[i+1:])
                for j in range(i+1,Len):
                    nums[j]=t[j-i-1]
                break
        if flag==0:
            nums.sort()