LeetCode 562. Longest Line of Consecutive One in Matrix(java)

Given a 01 matrix M, find the longest line of consecutive one in the matrix. The line could be horizontal, vertical, diagonal or anti-diagonal.Exampl...

2018-02-11 15:58:57

阅读数:56

评论数:0

LeetCode 62. Unique Paths(java)

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 right at any p...

2018-01-27 11:00:54

阅读数:28

评论数:0

LeetCode 279. Perfect Squares(java)

Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, …) which sum to n.For example, given n = 12, r...

2018-01-26 07:20:27

阅读数:32

评论数:0

LeetCode 96. Unique Binary Search Trees(java)

Given n, how many structurally unique BST’s (binary search trees) that store values 1…n?For example, Given n = 3, there are a total of 5 unique BST's...

2018-01-24 07:54:50

阅读数:18

评论数:0

LeetCode 221. Maximal Square(java)

Given a 2D binary matrix filled with 0’s and 1’s, find the largest square containing only 1’s and return its area.For example, given the following ma...

2018-01-22 08:24:22

阅读数:26

评论数:0

LeetCode 72. Edit Distance(java)

Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have ...

2018-01-22 07:13:07

阅读数:15

评论数:0

LeetCode 152. Maximum Product Subarray(java)

Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,3,-2,4], ...

2018-01-21 09:08:26

阅读数:11

评论数:0

LeetCode 337. House Robber III(java)

The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the “root.” Besides the root, each ho...

2018-01-21 05:21:50

阅读数:30

评论数:0

LeetCode 213. House Robber II(java)

Note: This is an extension of House Robber.After robbing those houses on that street, the thief has found himself a new place for his thievery so tha...

2018-01-20 10:04:15

阅读数:16

评论数:0

LeetCode 198. House Robber(java)

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 y...

2018-01-20 09:34:10

阅读数:31

评论数:0

LeetCode 70. Climbing Stairs(java)

You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you cl...

2018-01-16 11:56:09

阅读数:12

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭