老胡的笔记

题目 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 the head of the list. 题意：一个正整数，它的每一位存放在一

leetcode word search 的非递归实现

题目描述 Given a sorted integer array without duplicates, return the summary of its ranges. For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"]. 代码 class Solution(object): def sum