江湖小妞

2016年2月25日

摘要： Question: Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999. Analysis：给出一个整数，将它转换成罗马数字。注意：保阅读全文

posted @ 2016-02-25 22:01 江湖小妞阅读(157) 评论(0) 推荐(0) 编辑

LeetCode -- Unique Paths II

摘要： Question: Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many unique paths would there be? An obstacle and e 阅读全文

posted @ 2016-02-25 12:50 江湖小妞阅读(183) 评论(0) 推荐(0) 编辑

LeetCode -- Unique Paths

摘要： Question: A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or righ 阅读全文

posted @ 2016-02-25 12:45 江湖小妞阅读(125) 评论(0) 推荐(0) 编辑

2016年2月24日

LeetCode -- Minimum Path Sum

摘要： Question: Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along 阅读全文

posted @ 2016-02-24 20:56 江湖小妞阅读(207) 评论(0) 推荐(0) 编辑

LeetCode -- Longest Increasing Subsequence(LIS)

摘要： Question: Given an unsorted array of integers, find the length of longest increasing subsequence. For example,Given [10, 9, 2, 5, 3, 7, 101, 18],The l 阅读全文

posted @ 2016-02-24 15:27 江湖小妞阅读(502) 评论(0) 推荐(0) 编辑

LeetCode -- Increasing Triplet Subsequence

摘要： Question: Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array. Formally the function should: Retur 阅读全文

posted @ 2016-02-24 13:44 江湖小妞阅读(203) 评论(0) 推荐(0) 编辑

2016年2月23日

LeetCode -- Sum Root to Leaf NNumbers

摘要： Related Links: Path Sum: http://www.cnblogs.com/little-YTMM/p/4529982.html Path Sum II: http://www.cnblogs.com/little-YTMM/p/4531115.html Question: Gi 阅读全文

posted @ 2016-02-23 16:58 江湖小妞阅读(138) 评论(0) 推荐(0) 编辑

LeetCode -- Search a 2D Matrix & Search a 2D Matrix II

摘要： Question: Search a 2D Matrix Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Inte 阅读全文

posted @ 2016-02-23 11:12 江湖小妞阅读(290) 评论(0) 推荐(0) 编辑

2016年2月22日

LeetCode -- Best Time to Buy and Sell Stock with Cooldown

摘要： Question: Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You 阅读全文

posted @ 2016-02-22 13:40 江湖小妞阅读(254) 评论(0) 推荐(0) 编辑

2016年2月21日

LeetCode -- Maximum SubArray

摘要： Question: Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [−2,1, 阅读全文

posted @ 2016-02-21 09:36 江湖小妞阅读(185) 评论(0) 推荐(0) 编辑

公告