Luhn algorithm: Difference between revisions

Revision as of 20:46, 18 January 2024

Revision as of 13:05, 2 February 2024

Line 146:

int sum = 0;

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

if (i % 2 == 01) { //indexes go from 0 -> (length-1), so the odd indexes are the even digits

digit *= digit * 2;

}