摘要：
Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree. For example:Given the below binary tree, 1 / \ 2 3Return 6./** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNo... 阅读全文
posted @ 2013-10-03 23:38
懒猫欣
阅读(142)
评论(0)
推荐(0)
摘要：
Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree./** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NU... 阅读全文
posted @ 2013-10-03 22:54
懒猫欣
阅读(159)
评论(0)
推荐(0)
摘要：
Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree./** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(N... 阅读全文
posted @ 2013-10-03 21:46
懒猫欣
阅读(191)
评论(0)
推荐(0)
摘要：
Given an array of integers, every element appears three times except for one. Find that single one. Note:Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?class Solution {public: void toTribit(vector& bits,int val){ if(val0){... 阅读全文
posted @ 2013-10-03 21:27
懒猫欣
阅读(406)
评论(0)
推荐(0)
摘要：
There are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to its next station (i+1). You begin the journey with an empty tank at one of the gas stations.Return the sta 阅读全文
posted @ 2013-10-03 16:58
懒猫欣
阅读(214)
评论(0)
推荐(0)
摘要：
Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.OJ's undirected graph serialization:Nodes are labeled uniquely.We use # as a separator for each node, and , as a separator for node label and each neighbor of the node.As an example, consider the seria 阅读全文
posted @ 2013-10-03 00:58
懒猫欣
阅读(260)
评论(0)
推荐(0)
浙公网安备 33010602011771号