搜索资源列表
Number
- 编写一个java应用程序。用户从键盘输入一个1-9999之间的数，程序将判断这个数是几位数，并判断这个数是否回文数。回文数是指将数含有的数字逆序排列后得到的数和原数相同，例如12121,4224,6778776等都是回文数。-Write a java application. The user from the keyboard to enter a number between 1-9999, the program will determine whether this number is
huiwen2
- 用java现实判断是不是回文，如果是的话就输出是的信息，不是的话，输出不是。-Reality check with java is not palindromic, and if so the output is information, not the case, the output is not.
java1
- 1、编写一个Java应用程序。用户从键盘输入一个1～99999之间的整数，程序将判断这个数是几位数，并判断这个数是否是回文数。回文数是指将该数含有的数字逆序排列后得到的数和原数相同，如12121和3223都是回文数。 2、编写一个Java应用程序，该程序中有一个Rational(有理数)类，具体要求如下： ?Rational类有两个int型的成员变量，名字分别为numerator(分子)和denominator(分母)。 ?提供Rational add(Rational r)方法，即
HomeWork1
- 编写一个java应用程序。用户从键盘输入一个1-9999之间的数，程序将判断这个数是几位数，并判断这个数是否回文数。回文数是指将数含有的数字逆序排列后得到的数和原数相同，例如12121,4224,6778776等都是回文数。-Write a java application. User from the keyboard to enter a number between 1-9999, the program will determine this number is several numb
PalindromicPrimes
- Finds all the Palindromic Primes.
1-1000000000_huiwen
- 能够实现从1到10000000000的回文素数列举。效率较高，值得学习。-Can be achieved 1-10000000000 palindromic primes enumerated. Higher efficiency, it is worth learning.
plandrome
- A palindromic number is a number (in some base ) that is the same when written forwards or backwards, i.e., of the form . The first few palindromic numbers are therefore are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 22, 33, 44, 55, 66, 77, 88, 99, 101, 111,
MaxCallac
- 窗口化最长回文判断，输入一个字符串，返回字符串中最长的从左向右读和从右向左读相同的字符串-Windowing longest palindromic determination, input a String to return the same longest reading left to right and right to left read character string