2014 年 5月 23 日随笔档案 - neverlandly

2014年5月23日

摘要： Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example: Given the below binary tree and su 阅读全文

posted @ 2014-05-23 06:14 neverlandly 阅读(456) 评论(0) 推荐(0) 编辑

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.基本上一次过，要注意边界条件的问题：如果在recursion里有两个参数int begin, end, 递... 阅读全文

posted @ 2014-05-23 03:39 neverlandly 阅读(292) 评论(0) 推荐(0) 编辑

Leetcode: Merge Sorted Array

摘要： Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal... 阅读全文

posted @ 2014-05-23 02:56 neverlandly 阅读(256) 评论(0) 推荐(0) 编辑