coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 21:46:46 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/count-nice-pairs-in-an-array.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4.1K\", \"totalSubmission\": \"11.6K\", \"totalAcceptedRaw\": 4125, \"totalSubmissionRaw\": 11620, \"acRate\": \"35.5%\"}",
"stats": "{\"totalAccepted\": \"4.2K\", \"totalSubmission\": \"11.8K\", \"totalAcceptedRaw\": 4206, \"totalSubmissionRaw\": 11830, \"acRate\": \"35.6%\"}",
"hints": [
"The condition can be rearranged to (nums[i] - rev(nums[i])) == (nums[j] - rev(nums[j])).",
"Transform each nums[i] into (nums[i] - rev(nums[i])). Then, count the number of (i, j) pairs that have equal values.",