James Pan

原题网址:https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/Given an array nums and a target value k, find the maximum length of a subarray that sums to k. If there isn't one, return 0

原题网址：https://leetcode.com/problems/increasing-triplet-subsequence/Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.Formally the functio

原题网址：https://leetcode.com/problems/two-sum-iii-data-structure-design/Design and implement a TwoSum class. It should support the following operations: add and find.add - Add the number to an

原题网址：https://leetcode.com/problems/two-sum/Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have 

原题网址：https://leetcode.com/problems/course-schedule-ii/There are a total of n courses you have to take, labeled from 0 to n - 1.Some courses may have prerequisites, for example to take cour

原题网址：https://leetcode.com/problems/valid-parentheses/Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must

原题网址：https://leetcode.com/problems/palindrome-pairs/Given a list of unique words. Find all pairs of distinct indices (i, j) in the given list, so that the concatenation of the two words, i.e.

原题网址：https://leetcode.com/problems/generate-parentheses/Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a sol

原题网址：https://leetcode.com/problems/4sum-ii/Given four lists A, B, C, D of integer values, compute how many tuples (i, j, k, l) there are such that A[i] + B[j] + C[k] + D[l] is zero.To make