Home > Article > Backend Development > PHP implementation to generate unique numbers (36-digit non-repeating numbers)_PHP tutorial
When we want to number a huge amount of data, and the number has a limit on digits, such as a 5-digit license plate number, a 10-digit certificate number, an order serial number, a short URL, etc., we can use 36-digit Calculate a unique number that matches the number of digits.
We use 0-Z (0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ) to represent values 0-35 respectively, such as the letter Z representing 35. In this case, I want to get a 5-digit number. The maximum amount of information is 36 raised to the fifth power, 36^5 = 60466176, that is, the maximum 5-digit number is equivalent to a decimal number: 60466176.
For demonstration purposes in this article, we assume that a club issues a batch of 10-digit membership card numbers. The membership card number consists of a 3-digit city number + a 5-digit card number code + a 2-digit check code. The city number is represented by the area code. For example, 755 represents Shenzhen. The 5-digit card number is composed of a 36-digit card number. The following two check codes are generated through a certain algorithm. The purpose of the check code is to verify the card number. legality. In this case, the 10-digit card number we generate is equivalent to a maximum of more than 60 million membership card numbers, and it is a unique card number that does not repeat.
PHP implementation
We use PHP to convert decimal to hexadecimal.
We define the Code class and first define the password dictionary, that is, the values corresponding to 0-Z. The parameter $int in the method encodeID($int, $format) represents the number, and $format represents the length of digits, such as encodeID(123456789, 5) means converting the number 123456789 into a 5-digit 36-digit number, and the method decodeID($ids) is used to convert the 36-digit number into a decimal number.
We can generate the card number like this:
As above, we can get a 5-digit card number, which actually represents the membership number of the card number 888888 (6 eights), and the actual conversion is a 5-digit number: 0J1VC.
Next, we add the city number and check code. The city number has been defined, and the check code is obtained through a certain algorithm. In this example, we use a simple algorithm: add the first three city numbers and the five The card number is md5 encrypted, and then the first two digits of the md5 value are taken as the check code, so that the two-digit check code after the number is obtained.
In actual application, the decimal number can be obtained through the database to ensure that the number is unique, and then the above codes are combined to finally generate a 10-digit non-duplicate membership card number.