-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCreditCardValidation.java
More file actions
81 lines (65 loc) · 2.53 KB
/
Copy pathCreditCardValidation.java
File metadata and controls
81 lines (65 loc) · 2.53 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
// Exercise 6.31 (Financial: credit card number validation) on page 241
import java.util.Scanner;
public class CreditCardValidation {
public static void main(String[] args) {
// Create Scanner and prompt user for input
Scanner input = new Scanner(System.in);
System.out.print("Enter a credit card number as a long integer: ");
long creditCard = input.nextLong();
if (isValid(creditCard)) {
System.out.print(creditCard + " is valid\n");
}
else
{
System.out.print(creditCard + " is invalid\n");
}
}
/** Return true if the card number is valid */
public static boolean isValid(long number) {
boolean valid = (getSize(number) >= 13 && getSize(number) <= 16) && (prefixMatched(number, 4) || prefixMatched(number, 5) ||
prefixMatched(number, 37) || prefixMatched(number, 6)) && ((sumOfDoubleEvenPlace(number) + sumOfOddPlace(number)) % 10 == 0);
return valid;
}
/** Get the result from Step 2 */
public static int sumOfDoubleEvenPlace(long number) {
int sum = 0;
String num = number + "";
for (int i = getSize(number) - 2; i >= 0; i -= 2) {
sum += getDigit(Integer.parseInt(num.charAt(i) + "") * 2);
}
return sum;
}
/** Return this number if it is a single digit, otherwise, return the sum of the two digits */
public static int getDigit(int number) {
if (number < 9)
return number;
else
return number / 10 + number % 10;
}
/** Return sum of odd-place digits in number */
public static int sumOfOddPlace(long number) {
int sum = 0;
String num = number + "";
for (int i = getSize(number) - 1; i >= 0; i -= 2) {
sum += Integer.parseInt(num.charAt(i) + "");
}
return sum;
}
/** Return true if the digit d is a prefix for number */
public static boolean prefixMatched(long number, int d) {
return getPrefix(number, getSize(d)) == d;
}
/** Return the number of digits in d */
public static int getSize(long d) {
String num = d + "";
return num.length();
}
/** Return the first k number of digits from number. If the number of digits in number is less than k, return number. */
public static long getPrefix(long number, int k) {
if (getSize(number) > k) {
String num = number + "";
return Long.parseLong(num.substring(0, k));
}
return number;
}
}