摘要：
class Solution: # @param {integer} n # @return {integer} def numTrees(self, n): nums=[0]*(n+1) nums[0]=1 for i in range(1, n+1): for j in range(1, i+... 阅读全文
摘要：
# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass Solution: # ... 阅读全文
摘要：
Problem Difinition:Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the arr... 阅读全文