Luhn algorithm: Difference between revisions

Revision as of 11:06, 16 November 2023

Revision as of 08:49, 22 November 2023

Line 135:

return 10 - (check_digit % 10) == digits.Last();

}

</syntaxhighlight>

=== [[Java (programming language)|Java]] ===

<syntaxhighlight lang="java" line="1">

public static boolean isValidLuhn(String number) {

int checksum = Character.getNumericValue(number.charAt(number.length() - 1));

int total = 0;

for (int i = number.length() - 2; i >= 0; i--) {

int sum = 0;

int digit = Character.getNumericValue(number.charAt(i));

if (i % 2 == 0) {

digit *= 2;

}

sum = digit / 10 + digit % 10;

total += sum;

}

return 10 - total % 10 == checksum;

}

</syntaxhighlight>