摘要：
题目： 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 阅读全文
摘要：
题目： 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 pa 阅读全文
摘要：
题目： Given a list, rotate the list to the right by k places, where k is non-negative. （Medium） For example:Given 1->2->3->4->5->NULL and k = 2,return 4 阅读全文
摘要：
题目： Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order. For example,Given n = 3, You should return the fol 阅读全文
摘要：
题目： 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 阅读全文
摘要：
题目： Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order. For example,Given the following matrix: Y 阅读全文
摘要：
题目： 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 s 阅读全文
摘要：
题目： A 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 a 阅读全文
摘要：
题目： Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your m 阅读全文
摘要：
题目： 定义函数f(x)为x的最大奇数约数，x为正整数，例如f(44) = 11. 现在给出一个N,需要求出f(1) + f(2) + f(3) + ... + f(N) 例如： N = 7 f(1) + f(2) + f(3) + f(4) + f(5) + f(6) + f(7) = 1 + 1 阅读全文