oYinGui1

198. House RobberYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them

hdu-1003 Max Sum(DP解法)题目 Max Sum Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 221326 Accepted Submission(s): 52044 Problem

LeetCode OJ-5. Longest Palindromic Substring(最长回文子串)题目描述 Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example: Input:

LeetCode OJ-53.Maximum Subarray(最大连续子数组和)题目描述 Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [-2,1,-3,4,-1,

LeetCode OJ-62. Unique Paths(DP)题目描述 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 point in

LeetCode OJ-64.Minimum Path Sum(DP)题目描述 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 its path. Note