diff --git "a/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\351\237\246\346\230\214\345\235\244/Df.java" "b/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\351\237\246\346\230\214\345\235\244/Df.java"
new file mode 100644
index 0000000000000000000000000000000000000000..72bf0d36bf9fbfe414fe68895ec92a1ba3771a32
--- /dev/null
+++ "b/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\351\237\246\346\230\214\345\235\244/Df.java"
@@ -0,0 +1,27 @@
+package Lession10;
+import java.util.Scanner;
+public class Demo01 {
+
+	public static void main(String[] args) {
+
+				// m的n次幂
+				
+				Scanner abc = new Scanner(System.in);
+				
+				System.out.println("请输入m");
+				int a = abc.nextInt();
+				System.out.println("请输入n");
+				int b = abc.nextInt();
+				
+				System.out.println("m的n次幂是："+ciMi(a,b));
+			}
+			public static int ciMi(int a,int b) {
+				int c = 1;
+				for (int i = 0; i < b; i++) {
+					c = c * a;
+				}
+				return c;
+			}
+
+
+}
diff --git "a/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\351\237\246\346\230\214\345\235\244/Df2.java" "b/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\351\237\246\346\230\214\345\235\244/Df2.java"
new file mode 100644
index 0000000000000000000000000000000000000000..abc8de44174fd8875369e2fb008a112ed0ca14b1
--- /dev/null
+++ "b/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\351\237\246\346\230\214\345\235\244/Df2.java"
@@ -0,0 +1,35 @@
+package Lession10;
+
+import java.util.Random;
+import java.util.Scanner;
+
+public class Demo02 {
+
+	/**
+	 * @param args
+	 */
+	public static void main(String[] args) {
+		// 20个随机数
+				Scanner abc = new Scanner(System.in);
+				Random abcd = new Random();
+				int b[] = new int [20];
+				for (int i = 0; i < 20; i++) {
+					b[i] = abcd.nextInt(10)+1;
+				}
+				System.out.println("请输入要查找的数(0~10)");
+				int a = abc.nextInt();
+				int d = ciShu(a,b);
+				System.out.println("出现的次数是："+d);
+			}
+			public static int ciShu(int a,int b[]) {
+				int c = 0 ;
+				for (int i = 0; i <= 20; i++) {
+					if (a==b[i]) {
+						c++;
+					}
+				}
+				return c;
+
+	}
+
+}
diff --git "a/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\351\237\246\346\230\214\345\235\244/Df3.java" "b/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\351\237\246\346\230\214\345\235\244/Df3.java"
new file mode 100644
index 0000000000000000000000000000000000000000..bf7e9eb0e39b023933871782006b6ec2aa00b133
--- /dev/null
+++ "b/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\351\237\246\346\230\214\345\235\244/Df3.java"
@@ -0,0 +1,71 @@
+package Lession10;
+
+import java.util.Scanner;
+
+public class Demo03 {
+
+	public static void main(String[] args) {
+		// 最大值与第一个元素交换，最小值与最后一个元素交换
+				Scanner abc = new Scanner(System.in);
+				
+				int [] sum = new int [10];
+				System.out.println("请输入10个数");
+				for (int i = 0; i < 10; i++) {	
+					sum[i] = abc.nextInt();
+				}
+				int a = add(sum); 
+				
+				System.out.println("交换前的顺序");
+				for (int i = 0; i < sum.length; i++) {
+					System.out.print(sum[i]);
+				}
+				
+				
+				
+				System.out.println("交换后的顺序");
+				for (int i = 0; i < sum.length; i++) {
+					System.out.print(sum[i]);
+				}
+			
+			}
+
+			public static int add (int [] sum) {
+				int max = sum[0];
+				int maxindex = 0;
+				for (int i = 1; i < sum.length; i++) {
+					if (sum[i]>max) {
+						max = sum[i];
+					}
+				}
+				for (int i = 0; i < sum.length; i++) {
+					if (max<sum[i]) {
+						max=sum[i];
+						maxindex = i;
+					}
+					int temp = sum[0];
+					sum[0] = max;
+					sum[maxindex] = temp;
+				}
+				
+				int min = sum[0];
+				int minindex = 0;
+			
+				for (int i = 1; i < sum.length; i++) {
+					if (sum[i]<min) {
+						min = sum[i];
+					}
+					
+				}
+				for (int i = 0; i < sum.length; i++) {
+					if (min<sum[i]) {
+						min=sum[i];
+						minindex = i;
+					}
+					 int temp = sum[sum.length-1];
+					sum[sum.length-1] = min;
+					sum[minindex] = temp;
+					return sum[i];
+			}
+				return minindex;
+		}
+}