next permutaion算法
摘要:算法描述: Find largest index i such that array[i − 1] array[i − 1]. Swap array[j] and array[i − 1]. Reverse the suffix starting at array[i]. c++ include i
阅读全文
posted @ 2016-06-17 11:52
posted @ 2016-06-17 11:52
posted @ 2016-06-14 15:39
posted @ 2016-06-07 22:33
posted @ 2016-06-06 22:26
posted @ 2016-06-06 21:40
posted @ 2016-06-03 15:23