【017-Letter Combinations of a Phone Number （电话号码上的单词组合）】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题 Given a digit string, return all possible letter combinations that the number could represent.
A mapping...
分类：
编程语言 时间：
2015-07-21 09:11:42
阅读次数：
133
2..5 You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the...
分类：
其他好文 时间：
2015-07-20 21:17:55
阅读次数：
192
题目Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n.For example:
Given n = 13,
Return 6, because digit 1 occurred in the following n...
分类：
其他好文 时间：
2015-07-19 11:54:24
阅读次数：
102
Champernowne’s constant
Problem 40
An irrational decimal fraction is created by concatenating the positive integers:0.123456789101112131415161718192021…It can be seen that the 12th digit of the fract...
分类：
其他好文 时间：
2015-07-18 02:06:56
阅读次数：
158
The number 145 is well known for the property that the sum of the factorial of its digits is equal to 145:
1! + 4! + 5! = 1 + 24 + 120 = 145
Perhaps less well known is 169, in that it produces the...
分类：
其他好文 时间：
2015-07-17 22:49:49
阅读次数：
132
Plus One
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.
思路：...
分类：
其他好文 时间：
2015-07-17 19:00:08
阅读次数：
134
快速幂。只保存末位。快速幂的第一个题。#include#include#include#includeusing namespace std;int main(){ int T; scanf("%d",&T); while(T--) { int n; ...
分类：
Web程序 时间：
2015-07-17 13:55:32
阅读次数：
132
转换运算符：
implict 与explicit 两个关键词。
explicit为显示转换：
struct Digit
{
byte value;
public Digit(byte value) //constructor
{
if (value > 9)
{
throw new System.Argu...
分类：
其他好文 时间：
2015-07-17 10:03:54
阅读次数：
133
Jeff's gotncards, each card contains either digit 0, or digit 5. Jeff can choose several cards and put them in a line so that he gets some number. Wha...
分类：
其他好文 时间：
2015-07-16 22:06:14
阅读次数：
128
一、入门1、搜索字符串 babyfacer yoyo例子：\bbabyfacer\b.*\byoyo\b （\b和.*都是元字符）2、0\d\d-\d\d\d\d\d\d\d\d （digit）注1：（\d是个新的元字符，匹配一位数字(0，或1，或2，或……)。-不是元字符）。注2：[0-9]代表的...
分类：
其他好文 时间：
2015-07-16 13:56:05
阅读次数：
109
