青蛙一次一个或两个台阶那跳上n阶有多少种跳法并给出代码实现?
private static HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
public static int method(int n) {
if (n == 1) {
map.put(1, 1);
return 1;
}
if (n == 2) {
map.put(2, 2);
return 2;
}
Integer one = map.get(n - 1);
Integer two = map.get(n - 2);
if (one == null) {
one = method(n - 1);
map.put(n - 1, one);
}
if (two == null) {
two = method(n - 2);
map.put(n - 2, two);
}
return one + two;
// return method(n - 1) + method(n - 2);
}
手写一个冒泡排序代码或者选择排序代码?
//冒泡排序
public static void method1(int[] arr) {
for (int i = 0; i < arr.length - 1; i++) {
for (int j = i + 1; j < arr.length; j++) {
if (arr[i] > arr[j]) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
System.out.println(Arrays.toString(arr));
}
//选择排序
public static void method2(int[] arr) {
for (int i = 0; i < arr.length; i++) {
int minIndex = i;
int minValue = arr[i];
for (int j = i + 1; j < arr.length; j++) {
if (arr[j] < arr[minIndex]) {
minIndex = j;
minValue = arr[j];
}
}
int temp = arr[i];
arr[i] = minValue;
arr[minIndex] = temp;
}
System.out.println(Arrays.toString(arr));
}
Hadoop怎么从本地上传到hdfs文件?请写出命令行
hdfs dfs -put /local/xxx.txt /hdfs/
Innodb事务怎么实现的?
首先,我们知道事务具有ACID四个特性。也即:原子性,一致性,隔离性,持久性
sql题,根据学生表和成绩表关联查询出学生所有成绩都合格的学生姓名?
select
stu_name
from score group by stu_id having min(score)>60