北叶青藤

2016年8月4日

Binary Tree Longest Consecutive Sequence

摘要： Given a binary tree, find the length of the longest consecutive sequence path （连续的路径，不是从小到大）. The path refers to any sequence of nodes from some start 阅读全文

posted @ 2016-08-04 22:40 北叶青藤阅读(250) 评论(0) 推荐(0)

Additive Number

摘要： Additive number is a string whose digits can form additive sequence. A valid additive sequence should contain at least three numbers. Except for the f 阅读全文

posted @ 2016-08-04 09:12 北叶青藤阅读(196) 评论(0) 推荐(0)

311. Sparse Matrix Multiplication

摘要： Given two sparse matrices A and B, return the result of AB. You may assume that A's column number is equal to B's row number. Example: A = [ [ 1, 0, 0 阅读全文

posted @ 2016-08-04 05:39 北叶青藤阅读(176) 评论(0) 推荐(0)

314. Binary Tree Vertical Order Traversal

摘要： Given a binary tree, return the vertical order traversal of its nodes' values. (ie, from top to bottom, column by column). If two nodes are in the sam 阅读全文

posted @ 2016-08-04 04:19 北叶青藤阅读(330) 评论(0) 推荐(0)

Remove Duplicate Letters I & II

摘要： Remove Duplicate Letters I Given a string which contains only lowercase letters, remove duplicate letters so that every letter appear once and only on 阅读全文

posted @ 2016-08-04 02:03 北叶青藤阅读(220) 评论(0) 推荐(0)

Maximum Product of Word Lengths

摘要： Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assum 阅读全文

posted @ 2016-08-04 01:03 北叶青藤阅读(193) 评论(0) 推荐(0)

2016年8月3日

Verify Preorder Serialization of a Binary Tree

摘要： One way to serialize a binary tree is to use pre-order traversal. When we encounter a non-null node, we record the node's value. If it is a null node, 阅读全文

posted @ 2016-08-03 23:59 北叶青藤阅读(343) 评论(0) 推荐(0)

163. Missing Ranges & Summary Ranges

摘要： Missing Ranges You are given an inclusive range [lower, upper] and a sorted unique integer array nums, where all elements are in the inclusive range. 阅读全文

posted @ 2016-08-03 08:27 北叶青藤阅读(195) 评论(0) 推荐(0)

Bitwise AND of Numbers Range

摘要： Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive. For example, given the range [5, 阅读全文

posted @ 2016-08-03 07:19 北叶青藤阅读(170) 评论(0) 推荐(0)

199. Binary Tree Right Side View

摘要： Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom. For exa 阅读全文

posted @ 2016-08-03 04:48 北叶青藤阅读(147) 评论(0) 推荐(0)

公告