摘要：
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 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)
摘要：
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)
摘要：
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 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)
摘要：
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)
浙公网安备 33010602011771号