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

李恒道

https://leetcode.cn/problems/maximum-beauty-of-an-array-after-applying-operation/submissions/596274340/
这题猜测的有意思

var maximumBeauty = function (nums, k) {
  nums = nums.sort((a, b) => a - b);
  let left = 0;
  let ans = 0;
  for (let index = 0; index < nums.length; index++) {
    const num = nums[index];
    while (nums[left] + 2*k < num) {
      left++;
    }
    ans = Math.max(ans, index - left + 1);
  }
  return ans
};

李恒道

https://leetcode.cn/problems/range-addition-ii/submissions/596274960/
过

var maxCount = function (m, n, ops) {
    if(ops.length==0){
        return m*n
    }
  let minA = Number.MAX_SAFE_INTEGER,
    minB = Number.MAX_SAFE_INTEGER;
  for (let index = 0; index < ops.length; index++) {
    const [a,b] = ops[index];
    minA=Math.min(minA,a)
    minB=Math.min(minB,b)
  }
  return minA*minB
};

李恒道

https://leetcode.cn/problems/maximize-the-confusion-of-an-exam/submissions/596283440/
过

var maxConsecutiveAnswers = function(answerKey, k) {
  answerKey=answerKey.split("")
  const r1=maxSubarrayLength(answerKey,"F",k)
  const r2= maxSubarrayLength(answerKey,"T",k)
  return Math.max(r1,r2)

};
var maxSubarrayLength = function (nums,error, k) {
  let left = 0;
  const cache = new Map();
  let ans = 0;
  for (let index = 0; index < nums.length; index++) {
    const fruit = nums[index];
    cache.set(fruit, (cache.get(fruit) ?? 0) + 1);
    while (cache.get(error) > k) {
      if (cache.get(nums[left]) == 1) {
        cache.delete(nums[left]);
      } else {
        cache.set(nums[left], (cache.get(nums[left]) ?? 0) - 1);
      }
      left++;
    }
    ans = Math.max(ans, index - left + 1);
  }
  return ans;
};

李恒道

https://leetcode.cn/problems/max-consecutive-ones-iii/submissions/596287052/
过

var maxSubarrayLength = function (nums,error, k) {
  let left = 0;
  const cache = new Map();
  let ans = 0;
  for (let index = 0; index < nums.length; index++) {
    const fruit = nums[index];
    cache.set(fruit, (cache.get(fruit) ?? 0) + 1);
    while (cache.get(error) > k) {
      if (cache.get(nums[left]) == 1) {
        cache.delete(nums[left]);
      } else {
        cache.set(nums[left], (cache.get(nums[left]) ?? 0) - 1);
      }
      left++;
    }
    ans = Math.max(ans, index - left + 1);
  }
  return ans;
};

/**
 * @param {number[]} nums
 * @param {number} k
 * @Return {number}
 */
var longestOnes = function(nums, k) {
      return maxSubarrayLength(nums,0,k)
};

李恒道

https://leetcode.cn/problems/minimum-operations-to-reduce-x-to-zero/submissions/596287260/
神经刀了

var minOperations = function (nums, x) {
  let total = 0;
  let right = 0;
  let times = Number.MAX_SAFE_INTEGER;
  for (let index = 0; index < nums.length; index++) {
    total += nums[index];
    right = index;
    if (total >= x) {
      break;
    }
  }
  if (total == x) {
    times = right + 1;
  }
  let left = 0;
  for (let index = right; index >= 0; index--) {
    total -= nums[index];
    while (total < x && (nums.length - 1 - left) >= index) {
      total += nums[nums.length - 1 - left];
      left++;
    }
    if (total == x) {
      times = Math.min(times, index + left);
    }
  }
  return times == Number.MAX_SAFE_INTEGER ? -1 : times;
};

李恒道

https://leetcode.cn/problems/frequency-of-the-most-frequent-element/submissions/596358672/
秒了

var maxFrequency = function (nums, k) {
  nums = nums.sort((a, b) => a - b);
  let left = 0;
  let ans = 0;
  let total = 0;

  for (let index = 0; index < nums.length; index++) {
    const num = nums[index];
    let range = index - left + 1;
    total += num;
    while (total + k < range * num) {
      total -= nums[left];
      left++;
      range = index - left + 1;
    }
    ans = Math.max(ans,range);
  }
  return ans
};

李恒道

https://leetcode.cn/problems/take-k-of-each-character-from-left-and-right/submissions/596368346/
过了，爽

var takeCharacters = function (s, k) {
  const arr = [];
  for (let index = 0; index < s.length; index++) {
    const char = s[index];
    if (char == "a") {
      arr.push(0);
    } else if (char == "b") {
      arr.push(1);
    } else if (char == "c") {
      arr.push(2);
    }
  }
  const times = [0, 0, 0];
  let right = 0;
  while ((times[0] < k || times[1] < k || times[2] < k) && right < s.length) {
    times[arr[right]]++;
    right++;
  }
  if ((times[0] < k || times[1] < k || times[2] < k) && right >= s.length) {
    return -1;
  }
  let ans = right;
  let border = s.length - 1;
  let left = right - 1;
  while (left >= 0) {
    times[arr[left]]--;
    left--;
    while ((times[0] < k || times[1] < k || times[2] < k) && border > left) {
      times[arr[border]]++;
      border--;
    }
    while (times[arr[left]] - 1 > k) {
      times[arr[left]]--;
      left--;
    }
    ans = Math.min(ans, left + (s.length - border));
  }
  return ans;
};

李恒道

https://leetcode.cn/problems/find-the-longest-equal-subarray/submissions/596396081/
起飞，第一次1900分题

var longestEqualSubarray = function (nums, k) {
  const cache = new Map();
  for (let index = 0; index < nums.length; index++) {
    const num = nums[index];
    if (!cache.has(num)) {
      cache.set(num, []);
    }
    cache.get(num).push(index);
  }
  let ans = 0;
  for (const [key, arr] of cache) {
    if(ans>=arr.length){
      continue;
    }
    let left = 0;
    for (let right = 0; right < arr.length; right++) {
      while (arr[right] - arr[left] - (right - left) > k) {
        left++;
      }
      ans = Math.max(ans, right - left + 1);
    }
  }
  return ans
};

李恒道

https://leetcode.cn/problems/valid-palindrome-ii/submissions/596421486/
秒

var validPalindrome = function (s) {
  const checkEqual = (l, r, jump) => {
    let left = l,
      right = r;
    while (left < right) {
      if (s[left] == s[right]) {
        left++;
        right--;
      } else if (jump == false) {
        return (
          checkEqual(left+1, right, true) || checkEqual(left, right-1, true)
        );
      } else {
        return false;
      }
    }
    return true;
  };
  return checkEqual(0, s.length - 1, false);
};