diff --git "a/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\351\253\230\345\245\225/Demo1.java" "b/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\351\253\230\345\245\225/Demo1.java"
new file mode 100644
index 0000000000000000000000000000000000000000..dc0156223a2470670ed9b94f76c649c13fc9c14c
--- /dev/null
+++ "b/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\351\253\230\345\245\225/Demo1.java"
@@ -0,0 +1,24 @@
+import java.util.Scanner;
+
+public class Demo1 {
+
+	public static void main(String[] args) {
+		// TODO 三个数的立方和
+		
+		Scanner scan = new Scanner(System.in);
+		
+		System.out.println("请输入X的值");
+		int x=scan.nextInt();
+		System.out.println("请输入Y的值");
+		int y=scan.nextInt();
+		System.out.println("请输入Z的值");
+		int z=scan.nextInt();
+		
+		System.out.println("X,Y,Z的立方和为"+lifang(x, y, z));
+		
+	}
+	public static int lifang(int x,int y,int z){
+		int sum=x*x*x+y*y*y+z*z*z;
+		return sum;
+	}
+}
diff --git "a/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\351\253\230\345\245\225/Demo2.java" "b/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\351\253\230\345\245\225/Demo2.java"
new file mode 100644
index 0000000000000000000000000000000000000000..c98996cadbd1b2c37b95f25893f4d8811dd8192c
--- /dev/null
+++ "b/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\351\253\230\345\245\225/Demo2.java"
@@ -0,0 +1,28 @@
+import java.util.Scanner;
+
+public class Demo2 {
+
+	public static void main(String[] args) {
+		// TODO m的n次幂
+		Scanner scan =new Scanner(System.in);
+		
+		System.out.println("请输入一个数");
+		int m =scan.nextInt();
+		System.out.println("请输入一个数这个数将为上个的幂");
+		int n =scan.nextInt();
+		
+		System.out.println(m+"的"+n+"次幂为"+mi(n, m));
+		
+	}
+	public  static int mi(int m,int n) {
+		int sum=1;
+		int a=0;
+		while (a<n) {
+		sum=sum*m;
+		a++;			
+		}
+		
+		return sum;
+		
+	}
+}
diff --git "a/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\351\253\230\345\245\225/Demo3.java" "b/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\351\253\230\345\245\225/Demo3.java"
new file mode 100644
index 0000000000000000000000000000000000000000..47c971230946ef65493a9fad4130ac256e6d5a40
--- /dev/null
+++ "b/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\351\253\230\345\245\225/Demo3.java"
@@ -0,0 +1,27 @@
+import java.util.Random;
+import java.util.Scanner;
+
+public class Demo3 {
+ public static void main(String[] args) {
+	 //随机数和它在数组中出现的频率
+	 Scanner scan=new Scanner(System.in);
+	 Random ra=new Random();
+	 int numarr[] = new int[20];
+	 for (int i = 0; i < 20; i++) {
+		numarr[i]=ra.nextInt(10)+1; 
+		System.out.print("numarr["+(i+1)+"]="+numarr[i]+",");
+	}System.out.println();
+	 System.out.println("请输入一个0~10的数显示他的频率");
+	 int b=scan.nextInt();
+	 int sum=0;
+	 for (int i = 0; i < 20; i++) {
+		if(b==numarr[i]) {
+			sum++;
+		}
+		
+	}System.out.println(b+"在数组显示的频率为"+sum);
+	 
+	 
+	 
+}
+}
diff --git "a/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\351\253\230\345\245\225/Demo4.java" "b/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\351\253\230\345\245\225/Demo4.java"
new file mode 100644
index 0000000000000000000000000000000000000000..7cbc98f1c33eaacc4e070fd1acf493c59ecc5adf
--- /dev/null
+++ "b/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\351\253\230\345\245\225/Demo4.java"
@@ -0,0 +1,46 @@
+import java.util.Scanner;
+
+public class Demo4 {
+
+	public static void main(String[] args) {
+		// TODO 自动生成的方法存根
+		Scanner scan=new Scanner(System.in);
+		int num[]=new int[10];
+		
+		for (int j = 0; j < num.length; j++) {
+			System.out.println("请输入第"+(j+1)+"个数");
+			num [j]=scan.nextInt();
+			int max=num[0];
+			int min=num[0];
+			if(max>num[j]) {
+				max=num[j];
+			}
+			if(min<num[j]) {
+				min=num[j];
+			}
+			System.out.println(zuizhi(min, min, num));
+		}
+	}
+	public static int zuizhi(int max,int min,int num[]) {
+		int maxIndex=0;
+		int minIndex=0;
+		int temp;
+		for (int i = 0; i < num.length; i++) {
+			if(max==num[i]){
+				maxIndex=i;
+			}
+			if(min==num[i]){
+				minIndex=i;
+			}
+		}
+		temp =num[0];
+		num[0]=max;
+		num[maxIndex]=temp;
+		
+		temp=num[10];
+		num[10]=min;
+		num[minIndex]=temp;
+		
+		return temp;
+	}
+}