update

leetcode-cn/originData/4xy4Wx.json

@@ -12,7 +12,7 @@
             "translatedContent": "小力将 N 个零件的报价存于数组 `nums`。小力预算为 `target`，假定小力仅购买两个零件，要求购买零件的花费不超过预算，请问他有多少种采购方案。\n\n注意：答案需要以 `1e9 + 7 (1000000007)` 为底取模，如：计算初始结果为：`1000000008`，请返回 `1`\n\n\n**示例 1：**\n>输入：`nums = [2,5,3,5], target = 6`\n>\n>输出：`1`\n>\n>解释：预算内仅能购买 nums[0] 与 nums[2]。\n\n**示例 2：**\n>输入：`nums = [2,2,1,9], target = 10`\n>\n>输出：`4`\n>\n>解释：符合预算的采购方案如下：\n>nums[0] + nums[1] = 4\n>nums[0] + nums[2] = 3\n>nums[1] + nums[2] = 3\n>nums[2] + nums[3] = 10\n\n**提示：**\n- `2 <= nums.length <= 10^5`\n- `1 <= nums[i], target <= 10^5`\n",
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 42,
+            "likes": 47,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -155,7 +155,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"13.6K\", \"totalSubmission\": \"45.3K\", \"totalAcceptedRaw\": 13569, \"totalSubmissionRaw\": 45283, \"acRate\": \"30.0%\"}",
+            "stats": "{\"totalAccepted\": \"14.5K\", \"totalSubmission\": \"47.5K\", \"totalAcceptedRaw\": 14478, \"totalSubmissionRaw\": 47544, \"acRate\": \"30.5%\"}",
             "hints": [],
             "solution": null,
             "status": null,