10 2014 档案

Unique Binary Search Trees 三种解法 python
摘要：Givenn, how many structurally uniqueBST's(binary search trees) that store values 1...n?For example,Givenn= 3, there are a total of 5 unique BST's. 1... 阅读全文
posted @ 2014-10-09 10:23 zhidan 阅读(415) 评论(0) 推荐(0)
leetcode Longest Common Prefix 最长公共前缀 (python)
摘要：Write a function to find the longest common prefix string amongst an array of strings.class Solution: # @return a string #最长公共前缀 def longestC... 阅读全文
posted @ 2014-10-05 19:02 zhidan 阅读(487) 评论(0) 推荐(0)