何为方法
![]()
![]()
![]()
package com.zhu.method;
public class Demo02 {
public static void main(String[] args) {
int max = max(30, 40);
System.out.println(max);
}
//比大小
public static int max(int num1,int num2){
int result=0;
if(num1==num2){
System.out.println("两数想等");
return 0 ;//终止方法
}
if(num1>num2){
result = num1;
}
else {
result = num2;
}
return result;
}
}
package com.zhu.method;
public class Demo01 {
//main方法
public static void main(String[] args) {
//实际参数:实际调用传递给他的参数
int sum = add(1, 2);
System.out.println(sum);
//test();
}
//加法
//形式参数,用来定义作用的
public static int add(int a,int b){
return a+b;
}
public static void test(){
//用for循环输出1-1000之间能被5整除的数,并且每行输出3个
for (int i = 1; i <=1000; i++) {
if(i%5==0){
System.out.print(i+"\t");
}
if(i%15==0){
System.out.println("\n");
}
}
}
}
![]()
package com.zhu.method;
public class Demo02 {
public static void main(String[] args) {
int max = max(30, 40);
System.out.println(max);
}
//比大小
public static double max(double num1,double num2){
double result=0;
if(num1==num2){
System.out.println("两数想等");
return 0 ;//终止方法
}
if(num1>num2){
result = num1;
}
else {
result = num2;
}
return result;
}
//比大小
public static int max(int num1,int num2){
int result=0;
if(num1==num2){
System.out.println("两数想等");
return 0 ;//终止方法
}
if(num1>num2){
result = num1;
}
else {
result = num2;
}
return result;
}
}
![]()
package com.zhu.method;
public class Demo03 {
public static void main(String[] args) {
//args.length 数组长度
for (int i = 0; i < args.length; i++) {
System.out.println("args["+i+"]:"+args[i]);
}
}
}
![]()
![]()
![]()
package com.zhu.method;
//递归
public class Demo04 {
public static void main(String[] args) {
System.out.println(f(3));
}
public static int f(int n){
if(n==1){
return 1;
}
else {
return n*f(n-1);
}
}
}