coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 16:31:42 +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-cn/originData/count-nice-pairs-in-an-array.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"25.9K\", \"totalSubmission\": \"54.9K\", \"totalAcceptedRaw\": 25887, \"totalSubmissionRaw\": 54851, \"acRate\": \"47.2%\"}",
"stats": "{\"totalAccepted\": \"25.9K\", \"totalSubmission\": \"54.9K\", \"totalAcceptedRaw\": 25887, \"totalSubmissionRaw\": 54852, \"acRate\": \"47.2%\"}",
"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.",