丶Blank - 博客园

2015年4月9日

摘要： Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the fol... 阅读全文

posted @ 2015-04-09 16:03 丶Blank 阅读(132) 评论(0) 推荐(0) 编辑

Best Time to Buy and Sell Stock II ——LeetCode

摘要： Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete a... 阅读全文

posted @ 2015-04-09 12:15 丶Blank 阅读(136) 评论(0) 推荐(0) 编辑

Best Time to Buy and Sell Stock——LeetCode

摘要： Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (ie... 阅读全文

posted @ 2015-04-09 00:36 丶Blank 阅读(124) 评论(0) 推荐(0) 编辑

Number of Islands——LeetCode

摘要： Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacen 阅读全文

posted @ 2015-04-09 00:04 丶Blank 阅读(754) 评论(0) 推荐(0) 编辑

2015年4月8日

Longest Palindromic Substring——LeetCode

摘要： 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-04-08 00:31 丶Blank 阅读(179) 评论(0) 推荐(0) 编辑

4Sum——LeetCode

摘要： Given an arraySofnintegers, are there elementsa,b,c, anddinSsuch thata+b+c+d= target? Find all unique quadruplets in the array which gives the sum of ... 阅读全文

posted @ 2015-04-08 00:24 丶Blank 阅读(147) 评论(0) 推荐(0) 编辑

2015年4月6日

Word Ladder——LeetCode

摘要： 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-06 19:49 丶Blank 阅读(214) 评论(0) 推荐(0) 编辑

Letter Combinations of a Phone Number——LeetCode

摘要： Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephon... 阅读全文

posted @ 2015-04-06 15:02 丶Blank 阅读(122) 评论(0) 推荐(0) 编辑

2015年4月5日

Sum Root to Leaf Numbers——LeetCode

摘要： 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 rep... 阅读全文

posted @ 2015-04-05 23:17 丶Blank 阅读(111) 评论(0) 推荐(0) 编辑

Search a 2D Matrix ——LeetCode

摘要： Write an efficient algorithm that searches for a value in anmxnmatrix. This matrix has the following properties:Integers in each row are sorted from l... 阅读全文

posted @ 2015-04-05 20:47 丶Blank 阅读(265) 评论(0) 推荐(0) 编辑

似水流年。

快看，我要变身了。

公告