{leetcode}/problems/find-the-minimum-cost-array-permutation/[LeetCode - 3149. Find the Minimum Cost Array Permutation ^]
You are given an array nums which is a <span data-keyword="permutation">permutation of [0, 1, 2, …, n - 1]. The score of any permutation of [0, 1, 2, …, n - 1] named perm is defined as:
score(perm) = |perm[0] - nums[perm[1]]| + |perm[1] - nums[perm[2]]| + … + |perm[n - 1] - nums[perm[0]]|
Return the permutation perm which has the minimum possible score. If multiple permutations exist with this score, return the one that is <span data-keyword="lexicographically-smaller-array">lexicographically smallest among them.
Example 1:
<div class="example-block"> Input: <span class="example-io">nums = [1,0,2]
Output: <span class="example-io">[0,1,2]
Explanation:
<img alt="" src="https://assets.leetcode.com/uploads/2024/04/04/example0gif.gif" style="width: 235px; height: 235px;" />
The lexicographically smallest permutation with minimum cost is [0,1,2]. The cost of this permutation is |0 - 0| + |1 - 2| + |2 - 1| = 2.
Example 2:
<div class="example-block"> Input: <span class="example-io">nums = [0,2,1]
Output: <span class="example-io">[0,2,1]
Explanation:
<img alt="" src="https://assets.leetcode.com/uploads/2024/04/04/example1gif.gif" style="width: 235px; height: 235px;" />
The lexicographically smallest permutation with minimum cost is [0,2,1]. The cost of this permutation is |0 - 1| + |2 - 2| + |1 - 0| = 2.
Constraints:
-
2 ⇐ n == nums.length ⇐ 14 -
numsis a permutation of[0, 1, 2, …, n - 1].