Doris7

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

摘要： Description: Implement int sqrt(int x). Compute and return the square root of x, where x is guaranteed to be a non-negative integer. Since the return 阅读全文

摘要： Descirption: Given two binary strings, return their sum (also a binary string). The input strings are both non-empty and contains only characters 1 or 阅读全文

摘要： Description: Given a non-empty array of digits representing a non-negative integer, plus one to the integer. The digits are stored such that the most 阅读全文

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

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

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

摘要： Description: The set [1,2,3,...,n] contains a total of n! unique permutations. By listing and labeling all of the permutations in order, we get the fo 阅读全文

摘要： Description: Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string. If 阅读全文

摘要： Description: Given a collection of intervals, merge all overlapping intervals. Example 1: Example 2: Solution: 这道题要求将输入的数组序列中相互重叠的部分合并 对于这道题，我们需要思考，什么 阅读全文