写在前面:本人180,6块腹肌,朋友都说我长得帅,但是我一直有个问题,就是不知道梗佬是不是0?
我尊重他的选择。
1.
package sel4fil3;
/*
* 门牌号
* 1-2020需要多少个字符”2“;
*
* int -> String
* 循环判断每个字符串的字符是否包含2
*
*/
public class menpai {
public static void main(String[] args) {
String str = new String();
int count =0;
for(int i=1;i<=2020;i++) {
str = i+"";
for(int j=0;j<str.length();j++) {
if(str.charAt(j)=='2' ){
count++;
}
}
}
System.out.println(count);
}
}
2.
package sel4fil3;
import java.util.ArrayList;
/*
*ArrayList保存每个因子,三重循环输出
*/
public class menpai {
public static void main(String[] args) {
long num = 2021041820210418l;
ArrayList<Long> arr = new ArrayList<>();
for(long i=1;i<Math.sqrt(num);i++) {
if(num % i == 0) {
arr.add(i);
long n = num /i;
if(n != i) {
arr.add(n);
}
}
}
int ans =0;
for(int i=0;i<arr.size();i++) {
for(int j=0;j<arr.size();j++) {
for(int k =0;k<arr.size();k++) {
long H = arr.get(i);
long W = arr.get(j);
long L = arr.get(k);
if(H * W * L == num) {
ans++;
}
}
}
}
System.out.println(ans);
}
}
3.跳跃
package dtgh;
import java.util.Scanner;
/*
* 跳跃,每次走的直线距离不超过3,每次不超过3步
* 简单的动态规划
*
* 终止条件:i = n -1 && j = m-1;
*
*/
public class tioayue {
static Scanner sc = new Scanner(System.in);
static int n = sc.nextInt();
static int m = sc.nextInt();
static int [][] map = new int [n][m];
static int dx[] = {0,0,0,1,2,3,1,2,1};
static int dy[] = {1,2,3,0,0,0,1,1,2};
static int max_length = Integer.MIN_VALUE;
public static void main(String[] args) {
for(int i=0;i<n;i++) {
for(int j=0;j<m;j++) {
map[i][j] = sc.nextInt();
}
}
dfs(0,0,map[0][0]);
System.out.println(max_length);
}
private static void dfs(int i,int j,int length) {
if(i == n-1 && j == m-1)
max_length = Math.max(length, max_length);
for(int k=0;k<dx.length;k++) {
int nx = i+dx[k];
int ny = j+dy[k];
if(nx >=0 && ny >=0 && nx<n && ny <m) {
dfs(nx,ny,length+map[nx][ny]);
}
}
}
}
4.
不会