From cc0cb5baa5e35f707637ce5db8ddcf8ea9d32c6e Mon Sep 17 00:00:00 2001 From: "@yang-fenghao" <3440490984@qq.com> Date: Thu, 15 Apr 2021 19:37:54 +0800 Subject: [PATCH] first commit --- .../And.java" | 30 ++++++++++++++++++ .../Bian.java" | 21 +++++++++++++ .../Zuida.java" | 31 +++++++++++++++++++ 3 files changed, 82 insertions(+) create mode 100644 "\346\226\271\346\263\225\347\273\203\344\271\240/\346\235\250\344\270\260\350\261\252/And.java" create mode 100644 "\346\226\271\346\263\225\347\273\203\344\271\240/\346\235\250\344\270\260\350\261\252/Bian.java" create mode 100644 "\346\226\271\346\263\225\347\273\203\344\271\240/\346\235\250\344\270\260\350\261\252/Zuida.java" diff --git "a/\346\226\271\346\263\225\347\273\203\344\271\240/\346\235\250\344\270\260\350\261\252/And.java" "b/\346\226\271\346\263\225\347\273\203\344\271\240/\346\235\250\344\270\260\350\261\252/And.java" new file mode 100644 index 0000000..ca6e978 --- /dev/null +++ "b/\346\226\271\346\263\225\347\273\203\344\271\240/\346\235\250\344\270\260\350\261\252/And.java" @@ -0,0 +1,30 @@ +package 东东; + +public class And { + + public static void main(String[] args) { + // TODO Auto-generated method stub +int a[]= {10,20,55,78,95}; + +int b[]=dong(a); +System.out.println("最大值"+b[0]); +System.out.println("最小值"+b[1]); + } +public static int[] dong(int a[]) { +int max=a[0]; +int min=a[0]; +for (int i = 0; i < a.length; i++) { + if(a[0]a[i]) { + min=a[i]; + } +} +int b[] =new int[2]; +b[0]=max; +b[1]=min; +return b; + } + +} diff --git "a/\346\226\271\346\263\225\347\273\203\344\271\240/\346\235\250\344\270\260\350\261\252/Bian.java" "b/\346\226\271\346\263\225\347\273\203\344\271\240/\346\235\250\344\270\260\350\261\252/Bian.java" new file mode 100644 index 0000000..1639ab6 --- /dev/null +++ "b/\346\226\271\346\263\225\347\273\203\344\271\240/\346\235\250\344\270\260\350\261\252/Bian.java" @@ -0,0 +1,21 @@ +package dong; + +import java.util.Random; + +public class Bian { + + public static void main(String[] args) { + // TODO Auto-generated method stub +//需求:设计一个方法用于数组遍历,要求遍历的结果是打印输出在一行上的。例如:[11, 22, 33, 44, 55] +bianl(); + + } + public static void bianl() { + Random random = new Random(); + int[]a=new int[5]; + for(int i=0;i<5;i++) { + a[i]=random.nextInt(50)+10; + System.out.print(a[i]+","); + } +} +} \ No newline at end of file diff --git "a/\346\226\271\346\263\225\347\273\203\344\271\240/\346\235\250\344\270\260\350\261\252/Zuida.java" "b/\346\226\271\346\263\225\347\273\203\344\271\240/\346\235\250\344\270\260\350\261\252/Zuida.java" new file mode 100644 index 0000000..73e99ef --- /dev/null +++ "b/\346\226\271\346\263\225\347\273\203\344\271\240/\346\235\250\344\270\260\350\261\252/Zuida.java" @@ -0,0 +1,31 @@ +package dong; + +public class Zuida { + public static void main(String[] args) { + // TODO Auto-generated method stub +int arr[] = {65,60,80,70,90}; +int result=MAX1(arr); +int result1=MIN1(arr); +System.out.println("最大值"+result); +System.out.println("最小值"+result1); + } +public static int MAX1(int arr[]) { +int max=arr[0]; +for (int i = 0; i < arr.length; i++) { + if(arr[i]>arr[0]) { + max=arr[i]; + } +} +return max; +} +public static int MIN1(int arr[]) { +int min=arr[0]; +for (int i = 0; i < arr.length; i++) { + if(arr[i]