您的位置:首页 > 房产 > 建筑 > 短视频素材网站免费大推荐_简单代码制作_武汉竞价托管公司_网店推广运营策略

短视频素材网站免费大推荐_简单代码制作_武汉竞价托管公司_网店推广运营策略

2025/1/11 21:32:31 来源:https://blog.csdn.net/2401_87338545/article/details/144934021  浏览:    关键词:短视频素材网站免费大推荐_简单代码制作_武汉竞价托管公司_网店推广运营策略
短视频素材网站免费大推荐_简单代码制作_武汉竞价托管公司_网店推广运营策略

题目一: n的阶乘

804. n的阶乘 - AcWing题库

代码

import java.util.Scanner;public class Main {private static int fact(int n) {int res = 1;for(int i = 1; i <= n; i ++) res *= i;return res;}public static void main(String[] args) {Scanner sc = new Scanner(System.in);int n = sc.nextInt();System.out.println(fact(n));}
}

题目二:x和y的最大值

805. x和y的最大值 - AcWing题库

代码

import java.util.Scanner;public class Main {private static int max(int x, int y) {if(x > y) return x;else return y;}public static void main(String[] args) {Scanner sc = new Scanner(System.in);int x = sc.nextInt(), y = sc.nextInt();System.out.println(max(x,y));}
}

题目三:最大公约数

808. 最大公约数 - AcWing题库

代码

import java.util.Scanner;public class Main {private static int gcd(int a, int b) {while(b != 0) {int c = a%b;a = b; b = c;}return a;}public static void main(String[] args) {Scanner sc = new Scanner(System.in);int a = sc.nextInt(), b = sc.nextInt();System.out.println(gcd(a,b));}
}

题目四:交换数值

811. 交换数值 - AcWing题库

代码

import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner sc = new Scanner(System.in);int[] a = {sc.nextInt(), sc.nextInt()};swap(a);System.out.printf("%d %d\n",a[0],a[1]);}private static void swap(int[] a) {int t = a[0]; a[0] = a[1]; a[1] = t;}
}

题目五:打印数字

812. 打印数字 - AcWing题库

代码

import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner sc = new Scanner(System.in);int n = sc.nextInt(), size = sc.nextInt();int[] a = new int[n];for(int i = 0; i < n; i ++) a[i] = sc.nextInt();print1D(a,size);}private static void print1D(int[] a, int size) {for(int i = 0; i < size; i ++) System.out.printf("%d ",a[i]);}
}

题目六:打印矩阵

813. 打印矩阵 - AcWing题库

 代码

import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner sc = new Scanner(System.in);int r = sc.nextInt(), c = sc.nextInt();int[][] a = new int[r][c];for(int i = 0; i < r; i ++) for(int j = 0; j < c; j ++) a[i][j] = sc.nextInt();print2D(a,r,c);}private static void print2D(int[][] a, int r, int c) {for(int i = 0; i < r; i ++) {for(int j = 0; j < c; j ++) {System.out.printf("%d ",a[i][j]);}System.out.println("");}}
}

题目七:递归求阶乘

819. 递归求阶乘 - AcWing题库

代码

import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner sc = new Scanner(System.in);int n = sc.nextInt();System.out.println(fact(n));}private static int fact(int n) {if(n == 1) return 1;return fact(n-1)*n;}
}

题目八:递归求斐波那契数列

820. 递归求斐波那契数列 - AcWing题库

代码

import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner sc = new Scanner(System.in);int n = sc.nextInt();System.out.println(solve(n));}private static int solve(int n) {if(n == 1 || n == 2) return 1;return solve(n-1) + solve(n-2);}
}

版权声明:

本网仅为发布的内容提供存储空间,不对发表、转载的内容提供任何形式的保证。凡本网注明“来源:XXX网络”的作品,均转载自其它媒体,著作权归作者所有,商业转载请联系作者获得授权,非商业转载请注明出处。

我们尊重并感谢每一位作者,均已注明文章来源和作者。如因作品内容、版权或其它问题,请及时与我们联系,联系邮箱:809451989@qq.com,投稿邮箱:809451989@qq.com