public static int[] fullSquare(int n) {List<Integer> list = new ArrayList<Integer>();for (int i = 10; i * i < n; i++) {if (twoSame(i * i))list.add(i * i);}int[] resu...
public static int[] fullSquare(int n) {
List<Integer> list = new ArrayList<Integer>();
for (int i = 10; i * i < n; i++) {
if (twoSame(i * i))
list.add(i * i);
}
int[] result = new int[list.size()];
for (int i = 0; i < list.size(); i++)
result[i] = list.get(i);
return result;
}
public static boolean twoSame(int n) {
Set<Integer> set = new HashSet<Integer>();
while (n > 0) {
if (set.contains(n % 10))
return true;
set.add(n % 10);
n /= 10;
}
return false;
}
-
发表于 2020-07-05 12:31
- 阅读 ( 522 )
- 分类：web前端开发
