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:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/last-stone-weight-ii.json
View File

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"59.1K\", \"totalSubmission\": \"89K\", \"totalAcceptedRaw\": 59062, \"totalSubmissionRaw\": 89020, \"acRate\": \"66.3%\"}",
"stats": "{\"totalAccepted\": \"59.5K\", \"totalSubmission\": \"89.6K\", \"totalAcceptedRaw\": 59508, \"totalSubmissionRaw\": 89646, \"acRate\": \"66.4%\"}",
"hints": [
"Think of the final answer as a sum of weights with + or - sign symbols infront of each weight. Actually, all sums with 1 of each sign symbol are possible.",
"Use dynamic programming: for every possible sum with N stones, those sums +x or -x is possible with N+1 stones, where x is the value of the newest stone. (This overcounts sums that are all positive or all negative, but those don't matter.)"