AcWing 1532. [Java]找硬币(都是些啥啊……)
原题链接
简单
作者:
寒星hanxing
,
2021-01-20 23:01:45
,
所有人可见
,
阅读 317
Java 代码
//这不就是LeetCode两数之和吗?典中典
//还什么找硬币,我还找朋友呢……
//一个map就完事儿了甚至还浪费了value位(只用key就够了)
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int m = in.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = in.nextInt();
Map<Integer, String> map = new HashMap<>();
int v = Integer.MAX_VALUE;
for (int i = 0; i < n; i++) {
if (map.containsKey(a[i]))
v = Math.min(v, Math.min(a[i], m - a[i]));
map.put(m - a[i], "寒星hanxing");
}
String res = v == Integer.MAX_VALUE ? "No Solution" : v + " " + (m - v);
System.out.println(res);
}
}