Description:Given an array of non-negative
integers, you are initially positioned at the first index of the array.Each
element in the array represents...
分类：
其他好文 时间：
2014-06-09 00:15:33
阅读次数：
193
Recently we looked across some of the most
common behaviors that our community of 25,000 users looked for in their logs
with a particular focus on web...
分类：
其他好文 时间：
2014-06-08 22:19:29
阅读次数：
438
True Positive|True Negative|False
Positive|False Negative表示分类正确：True Positive：本来是正样例，分类成正样例。True
Negative：本来是负样例，分类成负样例。表示分类错误：False Positive：本来是负样例，分...
分类：
其他好文 时间：
2014-06-08 20:51:56
阅读次数：
298
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 digit. Add the two numbers and return it as a link...
分类：
其他好文 时间：
2014-06-08 15:30:28
阅读次数：
227
题目
Given a string S and a string T, count the number of distinct subsequences of T in S.
A subsequence of a string is a new string which is formed from the original string by deleting some (can be...
分类：
其他好文 时间：
2014-06-08 14:49:14
阅读次数：
347
Suppose a sorted array is rotated at some pivot
unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).You are
given a target value t...
分类：
其他好文 时间：
2014-06-08 02:05:43
阅读次数：
311
Follow up for "Unique Paths":Now consider if
some obstacles are added to the grids. How many unique paths would there be?An
obstacle and empty space i...
分类：
其他好文 时间：
2014-06-08 00:33:42
阅读次数：
339
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-07 23:03:35
阅读次数：
279
题目链接 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 p...
分类：
其他好文 时间：
2014-06-07 21:59:08
阅读次数：
344
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-07 16:56:28
阅读次数：
188
