【当前排名42710】挑战leetcode进入前1w名

李恒道

https://leetcode.cn/problems/TVdhkn/description/

var subsets = function (nums) {
    const ret = []
    const dfs = (arr, index) => {
        if(index==nums.length){
            ret.push([...arr]);
            return;
        }
        arr.push(nums[index]);
        dfs(arr, index + 1);
        arr.pop();
        dfs(arr, index + 1);
    }
    dfs([], 0)
    return ret
};

李恒道

https://leetcode.cn/problems/number-of-substrings-containing-all-three-characters/
过了

var numberOfSubstrings = function (s) {
  let left = 0;
  let ans = 0;
  const cnt = [0, 0, 0];
  for (let right = 0; right < s.length; right++) {
    const char = s[right].charCodeAt() - 97;
    cnt[char]++;
    while (cnt[0] > 0 && cnt[1] > 0 && cnt[2] > 0) {
      ans += s.length  - right;
      const leftChar = s[left].charCodeAt() - 97;
      cnt[leftChar]--;
      left++;
    }
  }
  return ans;
};

李恒道

https://leetcode.cn/problems/count-subarrays-where-max-element-appears-at-least-k-times/solutions/2560940/hua-dong-chuang-kou-fu-ti-dan-pythonjava-xvwg/
都没读懂题目我操

var countSubarrays = function (nums, k) {
  let max = Number.MIN_SAFE_INTEGER;
  for (let index = 0; index < nums.length; index++) {
    max = Math.max(max, nums[index]);
  }
  let cnt = 0;
  let left = 0;
  let ans=0;
  for (let index = 0; index < nums.length; index++) {
    const num = nums[index];
    if (num == max) {
      cnt++;
    }

      while (cnt >= k) {
        if (nums[left] == max) {
          cnt--;
        }
        left++;
      }
      ans+=left

  }
  return ans;
};

李恒道

https://leetcode.cn/problems/count-substrings-with-k-frequency-characters-i/submissions/596796638/
过了

var numberOfSubstrings = function (s, k) {
  const cnt = new Array(26).fill(0);
  let left = 0;
  let ans=0;
  for (let index = 0; index < s.length; index++) {
    const char = s[index].charCodeAt() - 97;
    cnt[char]++;
    if (cnt[char] == k) {
      while (cnt[char] >= k) {
        cnt[s[left].charCodeAt() - 97]--;
        left++;
      }
    }
    ans +=left;
  }
  return ans
};

李恒道

https://leetcode.cn/problems/count-complete-subarrays-in-an-array/submissions/596797027/
过

var countCompleteSubarrays = function (nums) {
  const set = new Set();
  for (const num of nums) {
    set.add(num);
  }
  const maxSize = set.size;
  let left = 0;
  let map = new Map();
  let ans = 0;
  for (let index = 0; index < nums.length; index++) {
    const num = nums[index];
    map.set(num, (map.get(num) ?? 0) + 1);
    while (map.size == maxSize) {
      map.set(nums[left], map.get(nums[left]) - 1);
      if (map.get(nums[left]) == 0) {
        map.delete(nums[left]);
      }
      left++;
    }
    ans += left;
  }
  return ans;
};

李恒道

https://leetcode.cn/problems/count-the-number-of-good-subarrays/submissions/596797442/
凹过去了

var countGood = function (nums, k) {
  let left = 0;
  let map = new Map();
  let paris = 0;
  let ans = 0;
  for (let index = 0; index < nums.length; index++) {
    const num = nums[index];
    if (map.get(num) >= 1) {
      paris += map.get(num);
    }
    map.set(num, (map.get(num) ?? 0) + 1);
    while (paris  >= k) {
      const leftNum = nums[left];
      map.set(leftNum, map.get(leftNum) - 1);
      if (map.get(nums[left]) > 0) {
        paris-=map.get(nums[left]);
      }
      left++;
    }
    ans += left;
  }
  return ans;
};

李恒道

https://leetcode.cn/problems/subarray-product-less-than-k/submissions/596976603/
过了

var numSubarrayProductLessThanK = function (nums, k) {
  let left = 0;
  let ans = 0;
  let total = 1;
  for (let index = 0; index < nums.length; index++) {
    const num = nums[index];
    total *= num;
    while (total >= k && total !== 1) {
      total = total / nums[left];
      left++;
    }
    if (total <k) {
      ans += index - left + 1;
    }
  }
  return ans;
};

李恒道

https://leetcode.cn/problems/count-substrings-that-satisfy-k-constraint-i/submissions/596979854/
过了

var countKConstraintSubstrings = function (s, k) {
  const times = [0, 0];
  let left=0;
  let ans=0;
  for (let index = 0; index < s.length; index++) {
    const pos = s[index].charCodeAt() - 48;
    times[pos]++;
    while(times[0]>k&&times[1]>k){
      const leftPos = s[left++].charCodeAt() - 48;
      times[leftPos]--;
    }
    ans+=index-left+1
  }
  return ans
};

李恒道

https://leetcode.cn/problems/count-subarrays-with-score-less-than-k/submissions/596994229/
1800分题神经刀了

var countSubarrays = function (nums, k) {
  let left = 0;
  let ans = 0;
  let total = 0;
  for (let index = 0; index < nums.length; index++) {
    const num = nums[index];
    total += num;

    while (total * (index - left + 1) >= k) {
      total = total - nums[left];
      left++;
    }
    if (total * (index - left + 1) < k) {
      ans += index - left + 1;
    }
  }
  return ans;
};

李恒道

https://leetcode.cn/problems/continuous-subarrays/submissions/597016958/
过了

var continuousSubarrays = function (nums) {
  let left = 0;
  let ans = 0;
  let list = new Map();
  for (let index = 0; index < nums.length; index++) {
    const num = nums[index];
    list.set(num, (list.get(num) ?? 0) + 1);

    while (true) {
      let mx = num,
        min = num;
      for (const [key, value] of list) {
        mx = Math.max(key, mx);
        min = Math.min(key, min);
      }
      if (mx - min <= 2) {
        break;
      }
      const leftNum = nums[left];
      list.set(leftNum, list.get(leftNum) - 1);
      if (list.get(leftNum) == 0) {
        list.delete(leftNum);
      }
      left++;
    }
    ans += index - left + 1;
  }
  return ans;
};