2015年2月17日
[LeetCode] Convert Sorted Array to Binary Search Tree 将有序数组转为二叉搜索树
摘要： Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced binary tree is d 阅读全文
posted @ 2015-02-17 14:45 Grandyang 阅读(17296) 评论(6) 推荐(0)
[转帖] 一些算法刷题的网站
摘要： 1. leetcodehttp://leetcode.com/2. careeruphttp://www.careercup.com/http://hawstein.com/posts/ctci-solutions-contents.html3. glassdoorhttp://www.glassd... 阅读全文
posted @ 2015-02-17 03:38 Grandyang 阅读(18092) 评论(2) 推荐(0)
Fork me on GitHub