[LeetCode] Reach a Number 达到一个数字
You are standing at position 0 on an infinite number line. There is a goal at position target. On each move, you can either go left or right. ...
原文：[LeetCode] 233. Number of Digit One 数字1的个数
Given an integer n, count the total number of digit appearing in all non negative integers less than or equal to n. For example: Given n , Return , because digit occurred in the following numbers: , ...
2015-07-08 02:50 3 16639 推荐指数：
相关推荐
[LeetCode] Number of Atoms 原子的个数
Given a chemical formula (given as a string), return the count of each atom. An atomic element a ...
[LeetCode] Number of 1 Bits 位1的个数
Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as the Hamming weight). For example ...
[LeetCode] Perfect Number 完美数字
We define the Perfect Number is a positive integer that is equal to the sum of all its positive divisors except itself. Now, given an integer n ...
[LeetCode] Single Number 单独的数字
Given a non-empty array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear ...
[LeetCode] Missing Number 丢失的数字
Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array. For example, Given nums ...
[LeetCode] Valid Number 验证数字
Validate if a given string can be interpreted as a decimal number. Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => ...
Leetcode 9. Palindrome Number(判断回文数字）
Determine whether an integer is a palindrome. Do this without extra space.（不要使用额外的空间） Some hints: ...