10:I[13699,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/bde5ef9330c4de2d.js"],"default"] 11:I[25152,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/bde5ef9330c4de2d.js"],"default"] 12:T433,class Solution { public int minSwaps(int[] nums) { int n = nums.length; int[] digitSum = new int[n]; for (int i = 0; i < n; i++) { int v = nums[i], s = 0; while (v > 0) { s += v % 10; v /= 10; } digitSum[i] = s; } Integer[] indices = new Integer[n]; for (int i = 0; i < n; i++) indices[i] = i; Arrays.sort(indices, (i, j) -> { if (digitSum[i] != digitSum[j]) return Integer.compare(digitSum[i], digitSum[j]); return Integer.compare(nums[i], nums[j]); }); int[] targetPos = new int[n]; for (int pos = 0; pos < n; pos++) targetPos[indices[pos]] = pos; boolean[] visited = new boolean[n]; int cycles = 0; for (int i = 0; i < n; i++) { if (!visited[i]) { cycles++; int j = i; while (!visited[j]) { visited[j] = true; j = targetPos[j]; } } } return n - cycles; } }13:T419,class Solution { public: int minSwaps(vector& nums) { int n = nums.size(); vector digitSum(n); for (int i = 0; i < n; i++) { int v = nums[i], s = 0; while (v > 0) { s += v % 10; v /= 10; } digitSum[i] = s; } vector indices(n); iota(indices.begin(), indices.end(), 0); sort(indices.begin(), indices.end(), [&](int i, int j) { if (digitSum[i] != digitSum[j]) return digitSum[i] < digitSum[j]; return nums[i] < nums[j]; }); vector targetPos(n); for (int pos = 0; pos < n; pos++) targetPos[indices[pos]] = pos; vector visited(n, false); int cycles = 0; for (int i = 0; i < n; i++) { if (!visited[i]) { cycles++; int j = i; while (!visited[j]) { visited[j] = true; j = targetPos[j]; } } } return n - cycles; } };

Time Complexity

Space Complexity