feat(leetcode): 1498. Number of Subsequences That Satisfy the Given Sum Condition : 双指针

Author: upupming

contest.js

@@ -0,0 +1,16 @@
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number}
+ */
+ var numSubseq = function(nums, target) {
+  const n = nums.length, P = 1e9+7
+  nums.sort((a, b) => a-b)
+  let ans = 0
+  for (let i = 0, j = n-1; i < n; i++) {
+      while (j > i && nums[i] + nums[j] > target) j--
+      if (j < i || nums[i] + nums[j] > target) break
+      ans = (ans + Number(2n ** BigInt(j-i) % BigInt(P))) % P
+  }
+  return ans
+};

leetcode/残酷刷题/1498. Number of Subsequences That Satisfy the Given Sum Condition.js

@@ -70,6 +70,7 @@
 - 424. Longest Repeating Character Replacement
 - 930. Binary Subarrays With Sum
 - 2106. Maximum Fruits Harvested After at Most K Steps
+- 1498. Number of Subsequences That Satisfy the Given Sum Condition
 
 ### 堆