1斐波那契蛇--java版
package day1; import java.util.ArrayList; import java.util.Collections; public class FibonacciSnake { public static void main(String[] args) { // TODO Auto-generated method stub int n=4; ArrayList<Integer> res=new ArrayList<>(); res.addAll(fibonacci(n*n-1)); Collections.reverse(res); int[][] re=revers(res, n); for(int i=0;i<n;i++) { for(int j=0;j<n;j++) { System.out.print(re[i][j]+" "); } System.out.println(); } } public static ArrayList<Integer> fibonacci(int n) { int[] res=new int[n+1]; res[0]=1; res[1]=1; if(n>1) { for(int i=2;i<=n;i++) { res[i]=res[i-1]+res[i-2]; } } ArrayList<Integer> list=new ArrayList<>(); for(int i=0;i<=n;i++) { list.add(res[i]); } return list; } public static int[][] revers(ArrayList<Integer> res,int n) { int[][] dp=new int[n][n]; int x1=0,x2=n-1,y1=0,y2=n-1,len=0; while(x1<=x2&&y1<=y2) { for(int j=y1;j<=y2;j++) { dp[x1][j]=res.get(len++); } for(int i=x1+1;i<=x2;i++) { dp[i][y2]=res.get(len++); } for(int j=y2-1;j>=y1;j--) { if(x1==x2) break; dp[x2][j]=res.get(len++); } for(int i=x2-1;i>x1;i--) { if(y1==y2) break; dp[i][x1]=res.get(len++); } x1++; y1++; x2--; y2--; } return dp; } }
2、跳远题,超级简单
package day1; import java.util.Scanner; public class Didi2 { public static void main(String[] args) { // TODO Auto-generated method stub Scanner in=new Scanner(System.in); while(in.hasNext()) { int n=in.nextInt(); int a=n/200; int m=n%200; int c=(m%10)/2; int b=(m-12*c)/10; if(a==0||a==b||a==c||b==c||a>9||b>9||c>9) { System.out.println(0); }else { System.out.println(a+" "+b+" "+c); } } in.close(); } }
菜鸡一个,勿喷。。。。