Portfolio

문제

Given an integer array nums, return the number of subarrays filled with 0.

A subarray is a contiguous non-empty sequence of elements within an array.

Example 1:


Input: nums = [1,3,0,0,2,0,0,4]
Output: 6
Explanation:
There are 4 occurrences of [0] as a subarray.
There are 2 occurrences of [0,0] as a subarray.
There is no occurrence of a subarray with a size more than 2 filled with 0. Therefore, we return 6.

Example 2:


Input: nums = [0,0,0,2,0,0]
Output: 9
Explanation:
There are 5 occurrences of [0] as a subarray.
There are 3 occurrences of [0,0] as a subarray.
There is 1 occurrence of [0,0,0] as a subarray.
There is no occurrence of a subarray with a size more than 3 filled with 0. Therefore, we return 9.

Example 3:


Input: nums = [2,10,2019]
Output: 0
Explanation: There is no subarray filled with 0. Therefore, we return 0.

Constraints:

1 <= nums.length <= 105

109 <= nums[i] <= 109

풀이

은찬


const zeroFilledSubarray = function(nums) {
    const arr = Array.from({length: 100001}, () => 0);
    const zeros = [];
    let answer = 0;
    let isContinuous = false;
    let count = 0;

    arr[1] = 1;

    for(let i = 1; i < 100001; i++) {
        arr[i] = arr[i - 1] + i;
    }

    for(let i = 0; i < nums.length; i++) {
        if(nums[i] === 0) {
            count++;

            if(!isContinuous) {
                isContinuous = true;
            }
        } else {
            if(isContinuous) {
                zeros.push(count);
            }
            count = 0;
            isContinuous = false;
        }
    }

    if(isContinuous) {
        zeros.push(count);
    }

    for(let i = 0; i < zeros.length; i++) {
        answer += arr[zeros[i]];
    }

    return answer;
};

효성


/**
 * @param {number[]} nums
 * @return {number}
 */
var zeroFilledSubarray = function (nums) {
    const cache = {};
    let curZeroCnt = 0;
    let answer = 0;

    const addToAnswer = () => {
        if (cache[curZeroCnt]) {
            answer += cache[curZeroCnt];
        }
        else {
            const cnt = getZeroCnt(curZeroCnt);
            answer += cnt;
            cache[curZeroCnt] = cnt;
        }
        curZeroCnt = 0;
    }

    nums.forEach(num => {
        if (num === 0) {
            curZeroCnt += 1;
        }
        if (curZeroCnt !== 0 && num !== 0) {
            addToAnswer();
        }
    });

    if (curZeroCnt !== 0) {
        addToAnswer();
    }

    return answer;
};

function getZeroCnt(num) {
    let res = 0;
    for (let i = 1; i <= num; i++) {
        res += i;
    }
    return res;
}

재영


/**
 * @param {number[]} nums
 * @return {number}
 */
const zeroFilledSubarray = (nums) => {
  let cnt = 0;
  let total = 0;

  for (let i = 0; i < nums.length; i += 1) {
    const now = nums[i];

    if (now === 0) {
      cnt += 1;
      total += cnt;
    } else {
      cnt = 0;
    }
  }

  return total;
};

Number of Zero-Filled Subarray

문제

풀이