2021年3月12日
[LeetCode] 1053. Previous Permutation With One Swap 交换一次的先前全排列
摘要： Given an array of positive integers (not necessarily distinct), return the lexicographically largest permutation that is smaller than , that can be ma 阅读全文
posted @ 2021-03-12 14:13 Grandyang 阅读(572) 评论(0) 推荐(0) 编辑
Fork me on GitHub