Gary Lai

2270. Number of Ways to Split Array

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

525. Contiguous Array

525. Contiguous Array 你寫得已經很清楚了,邏輯也都有講到,下面是我幫你稍微整理潤飾、補充說明的版本,也加了一些小細節讓整體更容易閱讀和理解,給你參考: 525.

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

1081. Smallest Subsequence of Distinct Characters

1081. Smallest Subsequence of Distinct Characters 同 316. Remove Duplicate

316. Remove Duplicate Letters

316. Remove Duplicate Letters 題目要求把一個字串中遇到重複的字元只保留其中一個字元後,將其他所有的重複的字元都移除,並且在最後結果的字串中,需要保留字典序。 這個題目的困難在於題目設立的幾個條件獨立的解決並不困難,困難的地方是要如何同時滿足,

870. Advantage Shuffle

870. Advantage Shuffle class Solution: def advantageCount(self, nums1: List[

240. Search a 2D Matrix II

240. Search a 2D Matrix II class Solution: def searchMatrix(

74. Search a 2D Matrix

74. Search a 2D Matrix class Solution: def searchMatrix(self,

410. Split Array Largest Sum

410. Split Array Largest Sum 原題: 1011. Capacity To Ship