不积跬步无以至千里

Unique Paths 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 time.The robot

Maximum Product Subarray 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],the contiguou

House Robber 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 you from robbing each of them

Gas Station There are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it costs cost[i] of gas to trave

求两个字符串的最长公共子串思路：

Palindrome Partitioning II Given a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning of s.For

Interleaving String Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.For example,Given:s1 = "aabcc",s2 = "dbbca",When s3 = "aadbbcbcac", return true.

Word Break II Total Accepted: 8514 Total Submissions: 54862My SubmissionsGiven a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a val

Word Break Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.For example, givens = "leetcod

给定数组如：[0, 1, 0, 1, 1, 0, 0, 0]

int findMaxSumOfMatrix(vector > &vvi){ int m = vvi.size(); if(0 == m) return 0; int n = vvi[0].size(); int maxValue = vvi[0][0]; for(int i = 0; i < m; i++){ //从第0行开始 vector vi(n, 0); for(

Triangle 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 following triangle[ [2]

Binary Tree Maximum Path Sum Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For example:Given the below binary tree, 1

Jump Game Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that positi