coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41: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

4
leetcode/originData/minimum-operations-to-make-the-integer-zero.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 258,
"likes": 259,
"dislikes": 277,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Broken Calculator\", \"titleSlug\": \"broken-calculator\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum Operations to Reduce X to Zero\", \"titleSlug\": \"minimum-operations-to-reduce-x-to-zero\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"8.4K\", \"totalSubmission\": \"28.9K\", \"totalAcceptedRaw\": 8362, \"totalSubmissionRaw\": 28880, \"acRate\": \"29.0%\"}",
"stats": "{\"totalAccepted\": \"8.4K\", \"totalSubmission\": \"28.9K\", \"totalAcceptedRaw\": 8367, \"totalSubmissionRaw\": 28889, \"acRate\": \"29.0%\"}",
"hints": [
"If we want to make integer n equal to 0 by only subtracting powers of 2 from n, in how many operations can we achieve it?",
"We need at least - the number of bits in the binary representation of n, and at most - n.",