Description
Magic Numbers
Write a program that finds and displays all pairs ofintegers and
such that:
neither nor
have any digits repeated; and , where
N is a given i...
分类：
其他好文 时间：
2014-07-10 20:10:06
阅读次数：
238
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 Ts d...
分类：
其他好文 时间：
2014-07-09 15:35:19
阅读次数：
176
题目
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent
a number.
An example is the root-to-leaf path 1->2->3 which represents the number 123.
Find ...
分类：
其他好文 时间：
2014-07-08 21:43:08
阅读次数：
219
两种方法翻转一个整数，顺序翻转和递归翻转这里没考虑overflow的情况递归的作用是使得反向处理，即从递归栈的最低端开始处理，通过画图可得。如果是rec(num/10):123451234123121 package recursion;
public class Reverse_digits_of_a_number {
public static void main(Str...
分类：
其他好文 时间：
2014-07-08 18:34:14
阅读次数：
208
The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resulting value contains two or more digits, those digits are summed and the process ...
分类：
其他好文 时间：
2014-07-08 14:12:32
阅读次数：
226
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 1’s ...
分类：
其他好文 时间：
2014-07-08 13:34:40
阅读次数：
195
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...
分类：
其他好文 时间：
2014-07-06 16:11:35
阅读次数：
170
DescriptionAn accutron shows time with four digits, from 0000 to 2359. Every digit is represented by 3*3 characters, including '|'s, '_'s and blanks. ...
分类：
其他好文 时间：
2014-07-06 13:19:09
阅读次数：
300
A message containing letters from A-Z is being encoded to numbers using the following mapping:
'A' -> 1
'B' -> 2
...
'Z' -> 26
Given an encoded message containing digits, determine the total numb...
分类：
其他好文 时间：
2014-07-05 23:41:41
阅读次数：
253
UVA 1341 - Different Digits
题目链接
题意：给定一个正整数n，求一个kn使得kn上用的数字最少，如果相同，则输出值最小的
思路：
首先利用鸽笼原理证明最多需要2个数字去组成
设一个数字k，组成k,kk,kkk,kkkk... %n之后余数必然在0 - (n - 1)之间，所以必然能选出两个余数相等的数字相减为0，这个数字就是由0和k组成的。
...
分类：
其他好文 时间：
2014-07-05 22:56:18
阅读次数：
289
