Prefix Sum

2090. K Radius Subarray Averages

2090. K Radius Subarray Averages 這個題目的重點是細心處理邊界問題。 class Solution: def getAverages(

1413. Minimum Value to Get Positive Step by Step Sum

1413. Minimum Value to Get Positive Step by Step Sum

2270. Number of Ways to Split Array

2270. Number of Ways to Split Array 此道題目需要先理解 Prefix Sum

525. Contiguous Array

525. Contiguous Array 題目給定一個陣列,陣列內有 0 和 1 兩種元素,要求最長的子陣列其內包含相同數量的

1314. Matrix Block Sum

1314. Matrix Block Sum 參考 304. Range Sum Query 2D

304. Range Sum Query 2D - Immutable

304. Range Sum Query 2D - Immutable 解題方式同: 303. Range

303. Range Sum Query - Immutable

303. Range Sum Query - Immutable class NumArray: def __init_

238. Product of Array Except Self

238. Product of Array Except Self 題目給定一個陣列含有多個整數,要問得出除了自身之外,其他整數的乘積,這個問題可以很輕鬆的透過窮舉的方式來求出答案,