diff --git "a/\346\225\260\347\273\204\347\273\203\344\271\240/\345\221\250\346\230\237\345\256\207/one.java" "b/\346\225\260\347\273\204\347\273\203\344\271\240/\345\221\250\346\230\237\345\256\207/one.java"
new file mode 100644
index 0000000000000000000000000000000000000000..49720629eec79f0cd62778db53758f44e439857b
--- /dev/null
+++ "b/\346\225\260\347\273\204\347\273\203\344\271\240/\345\221\250\346\230\237\345\256\207/one.java"
@@ -0,0 +1,44 @@
+import java.util.Scanner;
+
+public class one {
+	public static void main(String[]args) {
+		Scanner sc=new Scanner(System.in);
+		int max,min,sum;
+		max=0;
+		min=0;
+		sum=0;
+		int [] arr = new int[6];
+    	int a;
+    	System.out.println("请输入分数");
+    	a=sc.nextInt();
+    	for (int i = 0; i < arr.length; i++) {
+			 sc.nextInt();
+            if(a>=0&a<=100){
+    			arr[i]=a;
+            }else {
+            	System.out.println("错误");
+        		i--;
+    		}
+            
+    	}
+    	for (int i = 0; i < arr.length; i++) {
+    		if (arr[i]>max) {
+    			max=arr[i];
+    		}
+    	}
+    	for (int i = 0; i < arr.length; i++) {
+    		if (arr[i]<min) {
+    			min=arr[i];
+    		}
+    	}
+    	//拿到最大最小值
+    	for (int i = 0; i < arr.length; i++) {
+    		sum=arr[i]+sum;
+    		}
+    	//和
+    	int avg=0;
+    	avg=(sum-max-min)/4;
+    	System.out.println("平均分"+avg);
+    	}
+}
+
diff --git "a/\346\226\271\346\263\225\345\244\215\344\271\2402/\345\221\250\346\230\237\345\256\207/Demo0.java" "b/\346\226\271\346\263\225\345\244\215\344\271\2402/\345\221\250\346\230\237\345\256\207/Demo0.java"
new file mode 100644
index 0000000000000000000000000000000000000000..45b89dbb5e8a9f1ef51a1963799a4cc5136bd2cf
--- /dev/null
+++ "b/\346\226\271\346\263\225\345\244\215\344\271\2402/\345\221\250\346\230\237\345\256\207/Demo0.java"
@@ -0,0 +1,30 @@
+package Demo;
+
+import java.util.Random;
+
+public class Demo0 {
+	public static void main(String[] agrs) {
+		int a[]=new int [7];
+		String e=b(a);
+		System.out.println(e);
+		
+		
+	}
+	public static String b(int[] a) {
+		Random sc=new Random();
+		String b=" ";
+		for (int i = 0; i < a.length; i++) {
+			a[i]=sc.nextInt(10);
+				
+			}
+		for (int i = 0; i < a.length; i++) {
+			if (i==4) {
+				System.out.print(" "+a[i]);
+			}else {
+				System.out.print(a[i]);
+			}
+			
+		}
+		return b;
+	}
+}
diff --git "a/\346\226\271\346\263\225\345\244\215\344\271\2402/\345\221\250\346\230\237\345\256\207/Demo01.java" "b/\346\226\271\346\263\225\345\244\215\344\271\2402/\345\221\250\346\230\237\345\256\207/Demo01.java"
new file mode 100644
index 0000000000000000000000000000000000000000..70f925f957955f1079e4c3e4a47b21d8793a893d
--- /dev/null
+++ "b/\346\226\271\346\263\225\345\244\215\344\271\2402/\345\221\250\346\230\237\345\256\207/Demo01.java"
@@ -0,0 +1,24 @@
+package Demo;
+
+import java.util.Iterator;
+
+public class Demo01 {
+     public static void main(String [] args) {
+    	 int[] arr ={19, 28, 37, 46, 50};
+    	 name(arr);
+     }
+     public static void name(int a[]) {
+    	 int b = 0;
+    	 int end = a.length-1;
+    	 int temp;
+ 		for (; b < end; b++,end--) {
+			temp = a[end];
+			a[end] = a[b];
+			a[b] = temp;
+		}
+ 		for (int i = 0; i < a.length; i++) {
+ 			System.out.print(a[i]+" ");
+		}
+     }
+     
+}
diff --git "a/\346\226\271\346\263\225\345\244\215\344\271\2402/\345\221\250\346\230\237\345\256\207/Demo02.java" "b/\346\226\271\346\263\225\345\244\215\344\271\2402/\345\221\250\346\230\237\345\256\207/Demo02.java"
new file mode 100644
index 0000000000000000000000000000000000000000..3bceda92610b99a6c1caa0542a23d93cb5ac230e
--- /dev/null
+++ "b/\346\226\271\346\263\225\345\244\215\344\271\2402/\345\221\250\346\230\237\345\256\207/Demo02.java"
@@ -0,0 +1,25 @@
+package Demo;
+
+import java.util.Iterator;
+
+class Demo02 {
+    public static void main(String[] agrs) {
+    	int [] arr = {20,48,87,43,22};
+    	int temp=-1;
+    	for (int i = 0; i < arr.length; i++) {
+    		for (int j = 0; j < arr.length-1-i; j++) {
+				if (arr[j]<arr[j+1]) {
+					temp=arr[j+1];
+					arr[j+1]=arr[j];
+					arr[j]=temp;
+				}
+		}
+    }
+    	print(arr);
+}
+    public static void print(int[] a) {
+		for (int i = 0; i < a.length; i++) {
+			System.out.print(a[i] + ",");
+		}
+	}
+}
\ No newline at end of file
diff --git "a/\346\226\271\346\263\225\345\244\215\344\271\2402/\345\221\250\346\230\237\345\256\207/World.java" "b/\346\226\271\346\263\225\345\244\215\344\271\2402/\345\221\250\346\230\237\345\256\207/World.java"
new file mode 100644
index 0000000000000000000000000000000000000000..8022a4841e74b62e3a2f7b23668676ef40dce809
--- /dev/null
+++ "b/\346\226\271\346\263\225\345\244\215\344\271\2402/\345\221\250\346\230\237\345\256\207/World.java"
@@ -0,0 +1,62 @@
+import java.util.Scanner;
+
+public class World {
+    public static void main(String[] arge) {
+    	int [] naomi = {90,50,30,10};
+    	int [] yijigiu = new int [naomi.length+1];
+    	System.out.println();
+    	printArray(naomi);
+    	Scanner sc = new Scanner(System.in);
+    	System.out.println("请输入一个数字：");
+    	int num=sc.nextInt();
+    	int index=-1;
+    	for (int i = 0; i < yijigiu.length; i++) {
+			if(num>naomi[i]) {
+				index=i;
+				break;
+			}	
+			printArray(yijigiu);
+    	}
+    	
+      	 
+            if(index!=-1) {
+            	for (int i = 0; i < yijigiu.length; i++) {
+					if(i<index) {
+						yijigiu[i]=naomi[i];
+					}
+					if(i==index) {
+						yijigiu[i]=num;
+					}
+					if(i>index) {
+						yijigiu[i]=naomi[i-1];
+					}
+				}
+            		
+            		
+            }
+            else {
+            	for (int i = 0; i < yijigiu.length; i++) {
+					if(i==yijigiu.length-1){
+						yijigiu[1]= num;
+					}
+					else{
+						yijigiu[1]= naomi[i];
+					}
+				}
+            }
+            printArray(yijigiu);
+    }
+	private static void printArray(int[] naomi) {
+		// TODO Auto-generated method stub
+		System.out.println("[");
+		for (int i = 0; i < naomi.length; i++) {
+			if(i==naomi.length-1) {
+				System.out.println(naomi[i]);
+			}
+			else {
+				System.out.println(naomi[i]+",");
+			}
+		}
+		System.out.println("]");
+	}
+}
diff --git "a/\346\226\271\346\263\225\345\244\215\344\271\2402/\345\221\250\346\230\237\345\256\207/lost.java" "b/\346\226\271\346\263\225\345\244\215\344\271\2402/\345\221\250\346\230\237\345\256\207/lost.java"
new file mode 100644
index 0000000000000000000000000000000000000000..df2f16ce5565f8929945b2dea66fc97fed765c51
--- /dev/null
+++ "b/\346\226\271\346\263\225\345\244\215\344\271\2402/\345\221\250\346\230\237\345\256\207/lost.java"
@@ -0,0 +1,18 @@
+import java.util.Scanner;
+
+public class lost {
+	public static void main(String[] args) {
+	Scanner sc = new Scanner(System.in);
+	int a=10;
+	int b=20;
+    int c;
+    c=a;
+    a=b;
+    b=c;
+
+	System.out.println("a="+a);
+	System.out.println("b="+b);
+    }
+	
+	
+}
diff --git "a/\346\226\271\346\263\225\347\273\203\344\271\240/\345\221\250\346\230\237\345\256\207/Demo02.java" "b/\346\226\271\346\263\225\347\273\203\344\271\240/\345\221\250\346\230\237\345\256\207/Demo02.java"
new file mode 100644
index 0000000000000000000000000000000000000000..6ee10db29d21fa4cf077f405456a3b399bae72f6
--- /dev/null
+++ "b/\346\226\271\346\263\225\347\273\203\344\271\240/\345\221\250\346\230\237\345\256\207/Demo02.java"
@@ -0,0 +1,13 @@
+
+public class Demo02 {
+	public static void main(String[]args) {
+		int [] arr = {20,50,63,95};
+		a(arr);
+	}
+	public static void a(int[]a) {
+		for (int i = 0; i < a.length; i++) {
+			System.out.println(a[i]+",");
+		}
+	}
+	
+}
diff --git "a/\346\226\271\346\263\225\347\273\203\344\271\240/\345\221\250\346\230\237\345\256\207/Demo03.java" "b/\346\226\271\346\263\225\347\273\203\344\271\240/\345\221\250\346\230\237\345\256\207/Demo03.java"
new file mode 100644
index 0000000000000000000000000000000000000000..e0ed10115c289ff7462bb269044317af62fa62ed
--- /dev/null
+++ "b/\346\226\271\346\263\225\347\273\203\344\271\240/\345\221\250\346\230\237\345\256\207/Demo03.java"
@@ -0,0 +1,25 @@
+public class Demo03 {
+	public static void main(String[]args) {
+		int [] arr = {20,50,63,95};
+		int [] adc = six(arr);
+		for (int i = 0; i < adc.length; i++) {
+			System.out.println(adc[i]);
+		}
+	}
+	public static int[] six(int[]s) {
+		int [] rain = new int[2];
+		int max=s[0];
+		int min=s[0];
+		for (int i = 0; i < rain.length; i++) {
+			if(max<s[i]) {
+				max=s[i];
+			}
+			if(min>s[i]) {
+				s[i]=min;
+			}
+		}
+		rain[0]=max;
+		rain[1]=min;
+		return rain;
+	}
+}
diff --git "a/\346\226\271\346\263\225\347\273\203\344\271\240/\345\221\250\346\230\237\345\256\207/Dome01.java" "b/\346\226\271\346\263\225\347\273\203\344\271\240/\345\221\250\346\230\237\345\256\207/Dome01.java"
new file mode 100644
index 0000000000000000000000000000000000000000..0bec24ec46f15976a49aca9a20e3806ac00d2d59
--- /dev/null
+++ "b/\346\226\271\346\263\225\347\273\203\344\271\240/\345\221\250\346\230\237\345\256\207/Dome01.java"
@@ -0,0 +1,24 @@
+import java.util.Scanner;
+
+public class Dome01 {
+    public static void main(String[]args) {
+//
+//    	  * ①定义一个数组，用静态初始化完成数组元素初始化
+//    	  * ②定义一个方法，用来获取数组中的最大值，最值的认知和讲解我们在数组中已经讲解过了
+//    	  * ③调用获取最大值方法，用变量接收返回结果
+//    	  * ④把结果输出在控制台
+    	int [] arr = {20,50,63,95};
+    	int max = fan(arr);
+    	System.out.println(max);
+    }
+    public static int fan(int[] a) {
+    	int max=0;
+    	for (int i = 0; i < a.length; i++) {
+			if(a[i]>max) {
+				max=a[i];
+			}
+		}
+    	return max;
+    	
+    }
+}