- 分享
- 0
- 人气
- 0
- 主题
- 3
- 帖子
- 2550
- UID
- 205613
- 积分
- 893
- 阅读权限
- 17
- 注册时间
- 2009-3-6
- 最后登录
- 2011-6-16
- 在线时间
- 682 小时
|
请各位JAVA高手帮帮忙~
我做到 public static int getDigit(int even)到了第二组我就不会了~
小弟先在这里谢谢高手的帮忙
Credit card numbers follwoing cretain pattern. A credit card number must have between 13 and 16 digits. It must start with:
4 for Visa cards
5 for Master cards
37 for American Express cards
6 for Discover cards
In 1954, Hans Lubn of IBM proposed an algorithm for validating credit card numbers. The algorithm is useful to determine if a card number
is entered correctly or if a credit card is scanned correctly by a scanner. Almost all credit card numbers are generated follwoing this
validity check, commonly known as the Luhn check or the Mod 10 check, which can be described as follows (for illustraiton, consider the card
numebr 4388576018402625):
1) Double every second digit form right to left. It doubling of a digit results in a two-digit number, add up the two digits to get a
single-digit number.
2 * 2 = 4
2 * 2 = 4
4 * 2 = 8
1 * 2 = 2
6 * 2 = 12(1 + 2 = 3)
5 * 2 = 10(1 + 0 = 1)
8 * 2 = 16(1 + 6 = 7)
4 * 2 = 8
2) Now add all single-digit numbers from Step 1.
4 + 4 + 8 + 2 + 3 + 1 + 7 + 8 = 37
3) Add all digits int the odd places from right toleft in the card number.
5 + 6 + 0 + 8 + 0 + 7 + 8 + 3 = 37
4) Sum the results from Step 2 and Step 3.
37 + 37 = 74
5)If the result from Step 4 is divisible by 10, the card number is valid: otherwise, it is invalid. For example 4388576018402625 is invalid,
but the number 4388576018410707 is valid.
Write a programt hat prompts the user to enter a credit card number as a long integer. Display whether the number is valid.
Design your program to use the following methods:
/** Return true if the card number is valid */
//public boolean isValid(long number)
/** Get the result from Step 2*/
//public static int sumOfEvenPlace(long number)
/** Return this number if it is a single digit, otherwise,
return the sum of the two digits */
//public static int getDigit(int Number)
/** Return sum of odd place digits in number */
//public static int sumOfOddPlace(long number)
import java.util.*;
public class qqq
{
public static void main(String[] args)
{
String cardno;
int even;
int odd;
Scanner scan= new Scanner(System.in);
System.out.println("lease Enter The Credit Card Number: ");
cardno=scan.nextLine();
System.out.println("\nEven number: ");
for(int i=(cardno.length()-1);i>=0;i=i-1)
{
even=Integer.parseInt(cardno.substring(--i,(i+1)));
System.out.print(even);
System.out.println(" is "+getDigit(even));
}
System.out.println("\nOdd number: ");
for(int j=(cardno.length()-1);j>=0;j=j-2)
{
odd=Integer.parseInt(cardno.substring(j,(j+1)));
System.out.print(odd);
}
}
public static int getDigit(int even)
{
int sum=0;
even*=2;
if(even>9)
{
do{
sum=(int)(sum+even%10);
even=even/10;
}while(even%10!=0);
}
else
sum=even;
return sum;
}
} |
|