2009有道编程复赛.doc

??题目: UnrepeatingNunbers (350 points) Problem Statement: 如果一个数字十进制表达时，不存在连续两位数字相等，则称之为“不重复数”。例如，105，1234和12121都是“不重复数”，而11，100和1225不算。给定一个long类型数字A，返回大于A的最小“不重复数”。 Definition: Class: UnrepeatingNumbers Method: next Parameters: long Returns: long Method signature: long next(long A)(be sure your method is public) Constraints: A 取值范围是[0， 10^17]，注意是闭区间。 Examples: 0) 54 returns： 56 大于54的最小数字是55，但55不是“不重复数”。下一个数字是56，它满足条件。 1) 10 returns： 12 2) 9 returns： 10 3) 98 returns： 101 99和100都不是“不重复数”， 101是。 4) 21099 returns： 21201 解题报告: The first solution that one could think of is to just increase A until it becomes a unrepeating number. Verifying that a number is unrepeating requires to decompose it into a list of digits, which is a simple task. Unfortunately, the constraints for the problem said that A can be as large as 10^17, we can notice that with a value of A equal to 1 and 17 zeros, our algorithm would take a lot of time before the two most significant repeated digits are dealt with.However, the observation about spending too much time before dealing with significant repeated digits can be helpful. A good idea to optimize the previous algorithm would be to simply increase the digits that we need to increase. Instead of increasing the whole number until the repetition is handled correctly. This is actually an idea good enough to solve the problem. Unfortunately a lot of coders didnt consider special cases when implementing it which caused plenty of failed solutions. This was mostly due to the examples all having the repeated numbers in the least significant digits, which made it challenging to analyze the problem correctly. Lets analyze a good case in order to design an algorithm, A = 122055123, since the result must be greater than A, we will begin with 122055124:We find a first pair of repeated digits 22, the number needs to be changed within the second 2, we might increase the left side of the number and leave the other side intact.