[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  阅读(551)  评论(0)  编辑  收藏  举报
Fork me on GitHub