Given amxngrid filled with non-negative numbers, find a path from top left to bottom right whichminimizesthe sum of all numbers along its path.Note:Yo...
分类：
其他好文 时间：
2014-06-28 15:55:58
阅读次数：
196
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single ...
分类：
其他好文 时间：
2014-06-28 14:31:12
阅读次数：
201
题目描述Given a non-negative integer sequence A with length N, you can exchange two adjacent numbers each time. After K exchanging operations, what’s the ...
分类：
其他好文 时间：
2014-06-22 23:36:42
阅读次数：
232
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 y...
分类：
其他好文 时间：
2014-06-22 23:11:57
阅读次数：
310
Minimum Path Sum：Given amxngrid filled with non-negative numbers, find a path from top left to bottom right whichminimizesthe sum of all numbers along...
分类：
其他好文 时间：
2014-06-22 23:06:39
阅读次数：
290
Givennnon-negative integersa1,a2, ...,an, where each represents a point at coordinate (i,ai).nvertical lines are drawn such that the two endpoints of ...
分类：
其他好文 时间：
2014-06-22 10:45:17
阅读次数：
258
Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at...
分类：
其他好文 时间：
2014-06-20 14:43:53
阅读次数：
137
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single ...
分类：
其他好文 时间：
2014-06-17 23:38:04
阅读次数：
341
Given n non-negative integers a1, a2,
..., an, where each represents a point at coordinate (i, ai). n vertical
lines are drawn such that the two endpoints of line i is at (i, ai) and (i,
0). Fin...
分类：
其他好文 时间：
2014-06-17 22:17:43
阅读次数：
325
题目
Determine whether an integer is a palindrome. Do this without extra space.
Some hints:
Could negative integers be palindromes? (ie, -1)
If you are thinking of converting the integer to ...
分类：
其他好文 时间：
2014-06-17 16:12:39
阅读次数：
226
