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

李恒道

https://leetcode.cn/problems/hamming-distance/submissions/593245703/
简单题

/**
 * @param {number} x
 * @param {number} y
 * @Return {number}
 */
var hammingDistance = function(x, y) {
    x=x^y;
    let ans=0;
    while(x!==0){
      if(x&1){
        ans++
      }
      x=x>>1
    }
    return ans
};

李恒道

无语了
这题我以为是位压缩
结果是傻缓存

/**
 * @param {number} size
 */
var Bitset = function (size) {
  const bits = new Array(size).fill(0);
  this.bits = bits;
  this.nums = 0;
  this.flipStatus = false;
};

/**
 * @param {number} idx
 * @Return {void}
 */
Bitset.prototype.fix = function (idx) {
  if (this.flipStatus) {
    if (this.bits[idx] == 1) {
      this.bits[idx] = 0;
      this.nums--;
    }
  } else {
    if (this.bits[idx] == 0) {
      this.bits[idx] = 1;
      this.nums++;
    }
  }
};

/**
 * @param {number} idx
 * @return {void}
 */
Bitset.prototype.unfix = function (idx) {
  if (this.flipStatus) {
    if (this.bits[idx] == 0) {
      this.bits[idx] = 1;
      this.nums++;
    }
  } else {
    if (this.bits[idx] == 1) {
      this.bits[idx] = 0;
      this.nums--;
    }
  }
};

/**
 * @return {void}
 */
Bitset.prototype.flip = function () {
  this.flipStatus = !this.flipStatus;
};

/**
 * @return {boolean}
 */
Bitset.prototype.all = function () {
  if(this.flipStatus){
    return this.nums==0
  }
  return this.nums == this.bits.length;
};

/**
 * @return {boolean}
 */
Bitset.prototype.one = function () {
  if(this.flipStatus){
    return this.nums<this.bits.length
  }
  return this.nums > 0;
};

/**
 * @return {number}
 */
Bitset.prototype.count = function () {
  if(this.flipStatus){
    return this.bits.length-this.nums
  }
  return this.nums;
};

/**
 * @return {string}
 */
Bitset.prototype.toString = function () {
  if(this.flipStatus){
    let ans=""
    for (let index = 0; index < this.bits.length; index++) {
      ans+=this.bits[index]==1?"0":"1"
    }
    return ans
  }else{
    return this.bits.join("")
  }
};

李恒道

https://leetcode.cn/problems/insert-delete-getrandom-o1-duplicates-allowed/submissions/593320881/
今天比较困难
终于凹过了

var RandomizedCollection = function () {
  this.arr = [];
  this.map = new Map();
};

/**
 * @param {number} val
 * @Return {boolean}
 */
RandomizedCollection.prototype.insert = function (val) {
  this.arr.push(val);
  let ans = false;
  if (!this.map.has(val)) {
    ans = true;
    this.map.set(val, new Set());
  }
  const nums = this.map.get(val);
  nums.add(this.arr.length - 1);
  return ans;
};

/**
 * @param {number} val
 * @return {boolean}
 */
RandomizedCollection.prototype.remove = function (val) {
  if (!this.map.has(val)) {
    return false;
  }
  const nums = this.map.get(val);
  const pos = nums.values().next().value;
  this.map.get(val).delete(pos)
  if (pos !== this.arr.length - 1) {
    const temp = this.arr[this.arr.length - 1];
    this.map.get(temp).delete(this.arr.length - 1);
    this.arr[this.arr.length - 1] = this.arr[pos];
    this.arr[pos] = temp;
    this.map.get(temp).add(pos);
  }
  this.arr.pop();
  if (nums.size == 0) {
    this.map.delete(val);
  }
  return true;
};

/**
 * @return {number}
 */
RandomizedCollection.prototype.getRandom = function () {
  return this.arr[Math.floor(Math.random() * this.arr.length)];
}

李恒道

https://leetcode.cn/problems/shortest-subarray-with-or-at-least-k-i/submissions/593514403/
打卡题

var minimumSubarrayLength = function (nums, k) {
  const count = new Array(32).fill(0);
  let left = 0;
  let xorNum = 0;
  let ans=Number.MAX_SAFE_INTEGER
  for (let index = 0; index < nums.length; index++) {
    const num = nums[index];
    xorNum = xorNum | num;
    for (let pos = 0; pos < 32; pos++) {
      if (num & (1 << pos)) {
        count[pos] += 1;
      }
    }
    if (xorNum >= k) {
      while (xorNum >= k&&left<=index) {
        ans=Math.min(ans,index-left+1)
        const lastNum = nums[left];
        for (let pos = 0; pos < 32; pos++) {
          if (lastNum & (1 << pos)) {
            count[pos] -= 1;
          }
          if (count[pos] == 0) {
            xorNum = xorNum & ~(1 << pos);
          }
        }
        left++;
      }
    }
  }
  return ans==Number.MAX_SAFE_INTEGER?-1:ans
};

李恒道

https://leetcode.cn/problems/shortest-subarray-with-or-at-least-k-ii/submissions/593514559/
一摸一样的题

var minimumSubarrayLength = function (nums, k) {
  const count = new Array(32).fill(0);
  let left = 0;
  let xorNum = 0;
  let ans=Number.MAX_SAFE_INTEGER
  for (let index = 0; index < nums.length; index++) {
    const num = nums[index];
    xorNum = xorNum | num;
    for (let pos = 0; pos < 32; pos++) {
      if (num & (1 << pos)) {
        count[pos] += 1;
      }
    }
    if (xorNum >= k) {
      while (xorNum >= k&&left<=index) {
        ans=Math.min(ans,index-left+1)
        const lastNum = nums[left];
        for (let pos = 0; pos < 32; pos++) {
          if (lastNum & (1 << pos)) {
            count[pos] -= 1;
          }
          if (count[pos] == 0) {
            xorNum = xorNum & ~(1 << pos);
          }
        }
        left++;
      }
    }
  }
  return ans==Number.MAX_SAFE_INTEGER?-1:ans
};

李恒道

https://leetcode.cn/problems/find-subarray-with-bitwise-or-closest-to-k/submissions/593516945/
改一改又凑活一个

var minimumDifference = function (nums, k) {
  const count = new Array(32).fill(0);
  let left = 0;
  let xorNum = 0;
  let ans = Math.abs(k - nums[0]);
  for (let index = 0; index < nums.length; index++) {
    const num = nums[index];
    ans = Math.min(ans, Math.abs(num - k));
    xorNum = xorNum | num;
    for (let pos = 0; pos < 32; pos++) {
      if (num & (1 << pos)) {
        count[pos] += 1;
      }
    }
    if (xorNum >= k) {
      while (xorNum >= k && left <= index) {
        ans = Math.min(ans, Math.abs(xorNum - k));
        const lastNum = nums[left];
        for (let pos = 0; pos < 32; pos++) {
          if (lastNum & (1 << pos)) {
            count[pos] -= 1;
          }
          if (count[pos] == 0) {
            xorNum = xorNum & ~(1 << pos);
          }
        }
        left++;
      }
    }
    if (left <= index) {
      ans = Math.min(ans, Math.abs(xorNum - k));
    }
  }
  return ans;
};

王一之

ggnb 6w名了

李恒道

王一之 发表于 2025-1-16 14:31
ggnb 6w名了

1w名应该是够呛了
越打越没意思，300题以后就开始有边界感了
现在每天挑挑捡捡的打题

会的不做，会了还做什么
不会的不做，我不会还做什么