James Pan

原题网址：https://leetcode.com/problems/different-ways-to-add-parentheses/Given a string of numbers and operators, return all possible results from computing all the different possible ways to group

原题网址：https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/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

原题网址：https://leetcode.com/problems/alien-dictionary/There is a new alien language which uses the latin alphabet. However, the order among letters are unknown to you. You receive a list of words

原题网址：https://leetcode.com/problems/ugly-number-ii/Write a program to find the n-th ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 1, 2

原题网址：https://leetcode.com/problems/set-matrix-zeroes/Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.click to show follow up.Follow up:Did

原题网址：https://leetcode.com/problems/create-maximum-number/Given two arrays of length m and n with digits 0-9 representing two numbers. Create the maximum number of length k  from digits of th

原题网址：https://leetcode.com/problems/binary-tree-preorder-traversal/Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1

原题网址：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/pascals-triangle/Given numRows, generate the first numRows of Pascal's triangle.For example, given numRows = 5,Return[ [1], [1,1], [1,2,1],

原题网址：https://leetcode.com/problems/flatten-binary-tree-to-linked-list/Given a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5

原题网址：https://leetcode.com/problems/remove-duplicate-letters/Given a string which contains only lowercase letters, remove duplicate letters so that every letter appear once and only once. You mus