摘要：
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 阅读全文
摘要：
Determine whether an integer is a palindrome. Do this without extra space. 题目含义：不要使用额外空间，判断整数是否为回文 阅读全文
摘要：
Reverse digits of an integer. Example1: x = 123, return 321Example2: x = -123, return -321 题目含义翻转一个整数 相关题目：190. Reverse Bits 阅读全文
摘要：
Initially on a notepad only one character 'A' is present. You can perform two operations on this notepad for each step: Given a number n. You have to 阅读全文
摘要：
You are given n pairs of numbers. In every pair, the first number is always smaller than the second number. Now, we define a pair (c, d) can follow an 阅读全文
摘要：
Given a list of non-negative numbers and a target integer k, write a function to check if the array has a continuous subarray of size at least 2 that 阅读全文
摘要：
Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000. Example 1:Input: "bbbab 阅读全文
摘要：
【基本问题单元的定义】这取决于你所查看问题的角度，找到一个划分，推进问题的角度十分重要。作者找到的方式是dp[ i ][ j ],用来表示 substring( i , j），然后站在这个角度，假设substring(i , j )中的最大的结果是知道的，那么下一步需要确定的是，其如何影响下一个阶段 阅读全文
摘要：
You are given a list of non-negative integers, a1, a2, ..., an, and a target, S. Now you have 2 symbols + and -. For each integer, you should choose o 阅读全文
摘要：
Given an array of scores that are non-negative integers. Player 1 picks one of the numbers from either end of the array followed by the player 2 and t 阅读全文