LeetCode 386 Lexicographical Numbers

最新推荐文章于 2024-09-21 21:03:24 发布

狂浪贵公子

最新推荐文章于 2024-09-21 21:03:24 发布

阅读量965

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/niuooniuoo/article/details/52330444

版权

LeetCode 专栏收录该内容

219 篇文章 0 订阅

订阅专栏

Given an integer n, return 1 - n in lexicographical order.

For example, given 13, return: [1,10,11,12,13,2,3,4,5,6,7,8,9].

Please optimize your algorithm to use less time and space. The input size may be as large as 5,000,000.

For example, given 234,

return:[1, 10, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 11, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 12, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 13, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 14, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 15, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 16, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 17, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 18, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 19, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 2, 20, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 21, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 22, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 23, 230, 231, 232, 233, 234, 24, 25, 26, 27, 28, 29, 3, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 4, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 5, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 6, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 7, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 8, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 9, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99]

所以根据规律写代码，Runtime: 155 ms

	public List<Integer> lexicalOrder2(int n) {
		List<Integer> list = new ArrayList<>();
		dfs(0, n, list);
		return list;
	}

	public static void dfs(int pre, int n, List<Integer> list) {
		for (int i = 0; i <= 9; i++) {
			int num = pre + i;
			if (num == 0) continue;
			if (num > n) return;
			list.add(num);
			if (num * 10 <= n) {
				dfs(num * 10, n, list);
			}
		}
	}

方法二：

Runtime: 118 ms

	public List<Integer> lexicalOrder3(int n) {
		List<Integer> list = new ArrayList<>(n);
		int curr = 1;
		for (int i = 1; i <= n; i++) {
			list.add(curr);
			if (curr * 10 <= n) {
				curr *= 10;
			} else if (curr % 10 != 9 && curr + 1 <= n) {
				curr++;
			} else {
				while ((curr / 10) % 10 == 9) curr /= 10;//个位是9的话,回溯,因为k+1又是10的倍数
				curr = curr / 10 + 1;//回溯计算
			}
		}
		return list;
	}