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/super-pow/Your task is to calculate ab mod 1337 where a is a positive integer and b is an extremely large positive integer given in the form of an array.Exam

原题网址：https://leetcode.com/problems/validate-binary-search-tree/Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtre

原题网址：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/binary-tree-maximum-path-sum/Given a binary tree, find the maximum path sum.For this problem, a path is defined as any sequence of nodes from some starting

原题网址：https://leetcode.com/problems/count-univalue-subtrees/Given a binary tree, count the number of uni-value subtrees.A Uni-value subtree means all nodes of the subtree have the same value.

原题网址：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/find-minimum-in-rotated-sorted-array/Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7

原题网址：https://leetcode.com/problems/integer-to-english-words/Convert a non-negative integer to its english words representation. Given input is guaranteed to be less than 231 - 1.For example,

原题网址：https://leetcode.com/problems/count-of-range-sum/Given an integer array nums, return the number of range sums that lie in [lower, upper] inclusive.Range sum S(i, j) is defined as the su

原题网址：https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/Given an array of numbers, verify whether it is the correct preorder traversal sequence of a binary search tree.

原题网址：https://leetcode.com/problems/one-edit-distance/Given two strings S and T, determine if they are both one edit distance apart.方法：两个字符串长度最多相差1，或者最多只有一个字符不同。public class Solution { publ