coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +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

6
leetcode/originData/[no content]product-of-two-run-length-encoded-arrays.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 212,
"dislikes": 31,
"likes": 224,
"dislikes": 37,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[[1,3],[2,3]]\n[[6,3],[3,3]]\n[[1,3],[2,1],[3,2]]\n[[2,3],[3,3]]",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"17.4K\", \"totalSubmission\": \"29.9K\", \"totalAcceptedRaw\": 17435, \"totalSubmissionRaw\": 29893, \"acRate\": \"58.3%\"}",
"stats": "{\"totalAccepted\": \"19.5K\", \"totalSubmission\": \"33.6K\", \"totalAcceptedRaw\": 19540, \"totalSubmissionRaw\": 33581, \"acRate\": \"58.2%\"}",
"hints": [
"Keep track of the indices on both RLE arrays and join the parts together.",
"What is the maximum number of segments if we took the minimum number of elements left on both the current segments every time?"