James Pan

原题网址：https://leetcode.com/problems/maximum-subarray/ Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [−2,1

原题网址：https://leetcode.com/problems/wildcard-matching/ Implement wildcard pattern matching with support for '?' and '*'. '?' Matches any single character. '*' Matches any sequence of characters (

原题网址：https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/ Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the m

原题网址：https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/ There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the st