摘要：
Given an array of integers, the majority number is the number that occursmore than 1/3 of the size of the array. Find it. Notice There is only one maj 阅读全文
posted @ 2016-03-29 18:04
哥布林工程师
阅读(117)
评论(0)
推荐(0)
摘要：
Given the root and two nodes in a Binary Tree. Find the lowest common ancestor(LCA) of the two nodes. The lowest common ancestor is the node with larg 阅读全文
posted @ 2016-03-29 17:21
哥布林工程师
阅读(177)
评论(0)
推荐(0)
摘要：
Given a string, find the length of the longest substring without repeating characters. Example For example, the longest substring without repeating le 阅读全文
posted @ 2016-03-29 17:20
哥布林工程师
阅读(151)
评论(0)
推荐(0)
摘要：
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longes 阅读全文
posted @ 2016-03-29 12:47
哥布林工程师
阅读(150)
评论(0)
推荐(0)
摘要：
Given a sequence of integers, find the longest increasing subsequence (LIS). You code should return the length of the LIS. Clarification What's the de 阅读全文
posted @ 2016-03-29 12:33
哥布林工程师
阅读(188)
评论(0)
推荐(0)
浙公网安备 33010602011771号