- 博客(10)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 leetcode 63. Unique Paths II
/* leetcode 63. Unique Paths IIFollow 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 is marked as 1 and
2016-08-27 21:21:36
453
原创 leetcode 62. Unique Paths
/* leetcode 62. Unique PathsA 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 robo
2016-08-27 14:36:48
389
原创 leetcode 376. Wiggle Subsequence
/* leetcode 376. Wiggle SubsequenceA sequence of numbers is called a wiggle sequence if the differences between successive numbers strictly alternate between positive and negative. The first difference
2016-08-26 10:34:16
280
原创 leetcode 70. Climbing Stairs QuestionEditorial
/* 70. Climbing Stairs QuestionEditorial Solution My Submissions 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
2016-08-25 18:00:09
359
原创 leetcode 121. Best Time to Buy and Sell Stock
/* leetcode 121. Best Time to Buy and Sell Stockay you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie,
2016-08-25 17:38:49
225
原创 leetcode 303. Range Sum Query - Immutable
/* leetcode 303. Range Sum Query - Immutable Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.Example: Given nums = [-2, 0, 3, -5, 2, -1]sumRange(0,
2016-08-25 17:10:34
222
原创 Leetcode 43. Multiply Strings
/* Leetcode 43. Multiply Strings Given two numbers represented as strings, return multiplication of the numbers as a string. Note: The numbers can be arbitrarily large and are non-negative. Converting
2016-08-15 02:11:36
381
原创 leetcode 383. Ransom Note
//leetcode 383. Ransom Note /* Note: You may assume that both strings contain only lowercase letters. canConstruct("a", "b") -> false canConstruct("aa", "ab") -> false canConstruct("aa", "aab") -> true
2016-08-14 23:56:48
1298
原创 leetcode 8 Implement atoi to convert a string to an integer.
/* Implement atoi to convert a string to an integer.Requirements for atoi: 1. The function first discards as many whitespace characters as necessary until the first non-whitespace character is found. 2
2016-08-10 20:47:09
435
原创 leetcode 58. Length of Last Word
leetcode 58. Length of Last Word Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.If the last word does not exist,
2016-08-10 20:06:38
255
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人