文章目录

• 最短路
• 修改数组
• 游园安排

最短路

题目链接：https://www.lanqiao.cn/problems/609/learning/

修改数组

题目链接：http://lx.lanqiao.cn/problem.page?gpid=T2734

package daily;

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

/**
 * http://lx.lanqiao.cn/problem.page?gpid=T2734
 * 
 * @author Jia
 *
 */
public class day3_28_2 {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int[] ans = new int[N];
		Set<Integer> set = new HashSet<>();
		for (int i = 0; i < N; i++) {
			int num = sc.nextInt();
			while (set.contains(num)) {
				num++;
			}
			set.add(num);
			ans[i] = num;
		}
		sc.close();

		for (int i = 0; i < ans.length; i++) {
			System.out.print(ans[i] + " ");
		}
	}
}

游园安排

题目链接：http://lx.lanqiao.cn/problem.page?gpid=T2873