摘要: 原题链接在这里:https://leetcode.com/problems/best-time-to-buy-and-sell-stock/ 题目: Say you have an array for which the ith element is the price of a given sto 阅读全文
posted @ 2015-09-15 23:05 Dylan_Java_NYC 阅读(358) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/maximal-square/ 题目: Given a 2D binary matrix filled with 0's and 1's, find the largest square containing only 1' 阅读全文
posted @ 2015-09-15 22:41 Dylan_Java_NYC 阅读(284) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/maximum-product-subarray/ 题目: Find the contiguous subarray within an array (containing at least one number) whic 阅读全文
posted @ 2015-09-15 12:14 Dylan_Java_NYC 阅读(624) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/maximum-subarray/ 题目: Find the contiguous subarray within an array (containing at least one number) which has th 阅读全文
posted @ 2015-09-15 11:48 Dylan_Java_NYC 阅读(402) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/decode-ways/ 题目: A message containing letters from A-Z is being encoded to numbers using the following mapping: 阅读全文
posted @ 2015-09-15 07:37 Dylan_Java_NYC 阅读(380) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/minimum-path-sum/ 题目: Given a m x n grid filled with non-negative numbers, find a path from top left to bottom r 阅读全文
posted @ 2015-09-15 06:55 Dylan_Java_NYC 阅读(223) 评论(0) 推荐(0) 编辑
摘要: 原题俩接在这里:https://leetcode.com/problems/ugly-number-ii/ 题目: Write a program to find the n-th ugly number. Ugly numbers are positive numbers whose prime 阅读全文
posted @ 2015-09-15 06:21 Dylan_Java_NYC 阅读(276) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/ugly-number/ 题目: Write a program to check whether a given number is an ugly number. Ugly numbers are positive nu 阅读全文
posted @ 2015-09-15 06:07 Dylan_Java_NYC 阅读(195) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/powx-n/ 题目: Implement pow(x, n), which calculates x raised to the power n (xn). Example 1: Input: 2.00000, 10 Ou 阅读全文
posted @ 2015-09-15 03:00 Dylan_Java_NYC 阅读(268) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/perfect-squares/ 题目: Given a positive integer n, find the least number of perfect square numbers (for example, 1 阅读全文
posted @ 2015-09-15 00:51 Dylan_Java_NYC 阅读(272) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/sqrtx/ 题目: Implement int sqrt(int x). Compute and return the square root of x, where x is guaranteed to be a non 阅读全文
posted @ 2015-09-15 00:21 Dylan_Java_NYC 阅读(310) 评论(0) 推荐(0) 编辑