題目
先來看 219. Contains Duplicate II 的題目內容：
Given an integer array nums and an integer k, return trueif there are two distinct indices i and j in the array such that nums[i] == nums[j] and abs(i - j) <= k.
標籤: LeetCode
[LeetCode演算法 #53] 圖解 Maximum Subarray (Sliding Window)
題目
先來看 53. Maximum Subarray 的題目內容：
Given an integer array nums, find the subarray with the largest sum, and return its sum.
Example 1:
Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6
Explanation: The subarray [4,-1,2,1] has the largest sum 6.