coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21: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/number-of-subsequences-that-satisfy-the-given-sum-condition.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1066,
"dislikes": 100,
"likes": 1116,
"dislikes": 104,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[3,5,6,7]\n9\n[3,3,6,8]\n10\n[2,3,3,4,6,7]\n12",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"27.1K\", \"totalSubmission\": \"69.2K\", \"totalAcceptedRaw\": 27059, \"totalSubmissionRaw\": 69220, \"acRate\": \"39.1%\"}",
"stats": "{\"totalAccepted\": \"28.1K\", \"totalSubmission\": \"72K\", \"totalAcceptedRaw\": 28124, \"totalSubmissionRaw\": 71965, \"acRate\": \"39.1%\"}",
"hints": [
"Sort the array nums.",
"Use two pointers approach: Given an index i (choose it as the minimum in a subsequence) find the maximum j where j ≥ i and nums[i] +nums[j] ≤ target.",