摘要：
Given two words (startandend), and a dictionary, find the length of shortest transformation sequence fromstarttoend, such that:Only one letter can be ... 阅读全文
posted @ 2015-04-08 12:23
Eason Liu
阅读(315)评论(0)推荐(0)
编辑
摘要：
Given a binary tree, imagine yourself standing on therightside of it, return the values of the nodes you can see ordered from top to bottom.For exampl... 阅读全文
posted @ 2015-04-05 00:04
Eason Liu
阅读(220)评论(0)推荐(0)
编辑
摘要：
Given an array withnobjects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, wh... 阅读全文
posted @ 2015-04-01 16:26
Eason Liu
阅读(319)评论(0)推荐(0)
编辑
摘要：
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping yo... 阅读全文
posted @ 2015-04-01 15:31
Eason Liu
阅读(204)评论(0)推荐(0)
编辑
摘要：
Given a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there exists one unique longest pa... 阅读全文
posted @ 2015-03-30 22:04
Eason Liu
阅读(194)评论(0)推荐(0)
编辑
摘要：
Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the ord... 阅读全文
posted @ 2015-03-27 13:44
Eason Liu
阅读(236)评论(0)推荐(0)
编辑
摘要：
Maximum GapGiven an unsorted array, find the maximum difference between the successive elements in its sorted form.Try to solve it in linear time/spac... 阅读全文
posted @ 2015-03-21 16:15
Eason Liu
阅读(1031)评论(0)推荐(0)
编辑
摘要：
Reverse digits of an integer.Example1:x = 123, return 321Example2:x = -123, return -321click to show spoilers.Have you thought about this?Here are som... 阅读全文
posted @ 2015-03-21 13:54
Eason Liu
阅读(171)评论(0)推荐(0)
编辑
