coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/originData/minimum-total-cost-to-make-arrays-unequal.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.7K\", \"totalSubmission\": \"8.6K\", \"totalAcceptedRaw\": 3698, \"totalSubmissionRaw\": 8646, \"acRate\": \"42.8%\"}",
"stats": "{\"totalAccepted\": \"3.7K\", \"totalSubmission\": \"8.7K\", \"totalAcceptedRaw\": 3702, \"totalSubmissionRaw\": 8655, \"acRate\": \"42.8%\"}",
"hints": [
"How can we check which indices of <code>nums1</code> will be considered for swapping? How to minimize the number of such operations?",
"It can be seen that greedily swapping values of indices where <code>nums1[i] == nums2[i]</code> is the most optimal choice. How many values cannot be swapped this way?",