mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-06 07:51:41 +08:00
update
This commit is contained in:
@@ -167,7 +167,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"15K\", \"totalSubmission\": \"40.4K\", \"totalAcceptedRaw\": 14969, \"totalSubmissionRaw\": 40418, \"acRate\": \"37.0%\"}",
|
||||
"stats": "{\"totalAccepted\": \"15K\", \"totalSubmission\": \"40.4K\", \"totalAcceptedRaw\": 14974, \"totalSubmissionRaw\": 40426, \"acRate\": \"37.0%\"}",
|
||||
"hints": [
|
||||
"Think about if we have many primes to subtract from nums[i]. Which prime is more optimal?",
|
||||
"The most optimal prime to subtract from nums[i] is the one that makes nums[i] the smallest as possible and greater than nums[i-1]."
|
||||
|
Reference in New Issue
Block a user