TopcoderArchive
Archive
Archive
Algorithm problem

UnrepeatingNumbers

Problem statement, definition, constraints, and public examples.

Problem Statement

如果一个数字十进制表达时，不存在连续两位相同，则称之为“不重复数”。例如，105、1234和12121都是“不重复数”，而11、100和1225不是。

给定一个long类型数字A，返回大于A的最小“不重复数”。

Definition

Class:
UnrepeatingNumbers
Method:
getNext
Parameters:
long
Returns:
long
Method signature:
long getNext(long A)
(be sure your method is public)

Constraints

  • A 取值范围是[0, 10^17]，注意是闭区间。

Examples

  1. 54
    Returns: 56
    大于54的最小数字是55，但55不是“不重复数”。下一个数字是56，它满足条件。
  2. 10
    Returns: 12
  3. 9
    Returns: 10
  4. 98
    Returns: 101
    99和100都不是“不重复数”，但101是。
  5. 21099
    Returns: 21201

This problem statement is the exclusive and proprietary property of Topcoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of Topcoder, Inc. is strictly prohibited. (c)2024, Topcoder, Inc. All rights reserved.

Back to all problems