摘要：
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example,"A man, a plan, a canal: Pan 阅读全文
posted @ 2016-06-29 17:08
ranran1203
阅读(239)
评论(0)
推荐(0)
摘要：
Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that: For example, Give 阅读全文
posted @ 2016-06-29 16:18
ranran1203
阅读(166)
评论(0)
推荐(0)
摘要：
Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) fromstart to end, such that: For example, Given:start 阅读全文
posted @ 2016-06-29 15:13
ranran1203
阅读(254)
评论(0)
推荐(0)
摘要：
Given an unsorted array of integers, find the length of the longest consecutive elements sequence. For example,Given[100, 4, 200, 1, 3, 2],The longest 阅读全文
posted @ 2016-06-29 11:37
ranran1203
阅读(692)
评论(0)
推荐(0)
摘要：
Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number. An example is the root-to-leaf path1->2->3which re 阅读全文
posted @ 2016-06-29 10:35
ranran1203
阅读(184)
评论(0)
推荐(0)
摘要：
Given a 2D board containing'X'and'O', capture all regions surrounded by'X'. A region is captured by flipping all'O's into'X's in that surrounded regio 阅读全文
posted @ 2016-06-29 09:49
ranran1203
阅读(232)
评论(0)
推荐(0)
浙公网安备 33010602011771号