| | | | |

2016年10月11日

摘要： Given two binary strings, return their sum (also a binary string). For example,a = "11"b = "1"Return "100". 两个二进制数相加，并不难。阅读全文

posted @ 2016-10-11 18:34 xiaoba1203 阅读(134) 评论(0) 推荐(0) 编辑

leetcode 66 Plus One ----- java

摘要： 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 a 阅读全文

posted @ 2016-10-11 15:41 xiaoba1203 阅读(135) 评论(0) 推荐(0) 编辑

leetcode 65 Valid Number ----- java

摘要： Validate if a given string is numeric. Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => true Note: It is intended for the 阅读全文

posted @ 2016-10-11 15:11 xiaoba1203 阅读(152) 评论(0) 推荐(0) 编辑

leetcode 64 Minimum Path Sum ----- java

摘要： 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. 阅读全文

posted @ 2016-10-11 12:36 xiaoba1203 阅读(154) 评论(0) 推荐(0) 编辑

leetcode 63 Unique Paths II ---java

摘要： 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 阅读全文

posted @ 2016-10-11 12:08 xiaoba1203 阅读(147) 评论(0) 推荐(0) 编辑

2016年10月11日

公告