u014748614的专栏

Validate Binary Search Tree 题目：http://www.lintcode.com/en/problem/validate-binary-search-tree/ Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is de

这道题感觉非常有意思，值得记录一下。思路来源：https://codesolutiony.wordpress.com/2015/05/28/lintcode-maximum-subarray-difference/ public class Solution { /** * @param nums: A list of integers * @return:

Given two values k1 and k2 (where k1 Example If k1 = 10 and k2 = 22, then your function should return [12, 20, 22]. 20 / \ 8 22 / \ 4 12 /** * Definition of TreeNo

Medium Binary Tree Maximum Path Sum Show result  23% Accepted Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. Example: Given th

Easy Minimum Path Sum Show result  34% Accepted Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numb

Binary Search Tree Iterator Design an iterator over a binary search tree with the following rules: Elements are visited in ascending order (i.e. an in-order traversal)next() and hasNext(

Binary Tree Level Order Traversal http://www.lintcode.com/problem/binary-tree-level-order-traversal Given a binary tree, return the level order traversal of its nodes' values. (ie, from

Lowest Common Ancestor http://www.lintcode.com/problem/lowest-common-ancestor Given the root and two nodes in a Binary Tree. Find the lowest common ancestor(LCA) of the two nodes. T

判断是否为balanced binary tree： http://www.lintcode.com/en/problem/balanced-binary-tree/ Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is

Given an array of integers and a number k, find k non-overlapping subarrays which have the largest sum. The number in each subarray should be contiguous. Example Given [-1,4,-2,3,-2,3], k