2013年9月9日

[leetcode.com]算法题目 - Same Tree

摘要： Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value. 1 /** 2 * Definition for binary tree 3 * struct TreeNode { 4 * int val; 5 * TreeNode *left; 6 * Tree... 阅读全文

posted @ 2013-09-09 22:23 Horstxu 阅读(208) 评论(0) 推荐(0) 编辑

[leetcode.com]算法题目 - Triangle

摘要： Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [3,4], [6,5,7], [4,1,8,3]]The minimum path sum from top to bottom is11(i.e.,2+3+5+1= 11).Note:Bonus point if you are a... 阅读全文

posted @ 2013-09-09 19:38 Horstxu 阅读(467) 评论(0) 推荐(0) 编辑

导航