Warning: Illegal string offset 'lang' in /var/www/html/wp_huangwenchao/wp-content/plugins/wp-highlightjs/wp_highlight.js.php on line 119
def next_permutation(a):
# if list has less than two elements, has no next permutation.
if len(a) < 2: return False
# step 1: find max i for a[i] > a[i+1]
i = len(a)-2
while i >= 0 and a[i] >= a[i+1]: i -= 1
if i < 0: return False
j = i + 1
# step 2: find max k for a[k] > a[i]
k = len(a) - 1
while a[i] >= a[k]: k -= 1
# step 3: swap a[i] and a[k]
(a[i], a[k]) = (a[k], a[i])
# step 4: reverse a[j:]
a[j:] = a[:j-1:-1]
return True
def prev_permutation(a):
# if list has less than two elements, has no prev permutation.
if len(a) < 2: return False
# step 1: find max i for a[i] < a[i+1]
i = len(a)-2
while i >= 0 and a[i] <= a[i+1]: i -= 1
if i < 0: return False
j = i + 1
# step 2: find max k for a[k] < a[i]
k = len(a) - 1
while a[i] <= a[k]: k -= 1
# step 3: swap a[i] and a[k]
(a[i], a[k]) = (a[k], a[i])
# step 4: reverse a[j:]
a[j:] = a[:j-1:-1]
return True