2017年7月23日
LeetCode 66. Plus One（加1）
摘要： Given a non-negative integer represented as a non-empty array of digits, plus one to the integer. You may assume the integer do not contain any leadin 阅读全文
posted @ 2017-07-23 03:04 Jimmy_Cheng 阅读(730) 评论(0) 推荐(0)
LeetCode 64. Minimum Path Sum（最小和的路径）
摘要： 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 @ 2017-07-23 02:44 Jimmy_Cheng 阅读(291) 评论(0) 推荐(0)