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

2
leetcode/originData/number-of-subsequences-that-satisfy-the-given-sum-condition.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"109.9K\", \"totalSubmission\": \"249.6K\", \"totalAcceptedRaw\": 109855, \"totalSubmissionRaw\": 249581, \"acRate\": \"44.0%\"}",
"stats": "{\"totalAccepted\": \"109.9K\", \"totalSubmission\": \"249.6K\", \"totalAcceptedRaw\": 109866, \"totalSubmissionRaw\": 249601, \"acRate\": \"44.0%\"}",
"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.",