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 shaolw 阅读(180) 评论(0) 推荐(0) 编辑
