Leetcode 31. Next Permutation Solution with golang
31. Next Permutation
Example Case : [2,3,6,5,4,1]
Algorithm
Step1 from right to left, find the first number which not increase in a ascending order. In this case which is 3.
Step2 here we can have two situations:
We cannot find the number, all the...
goleetcode.hashnode.dev2 min read