diff --git "a/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\346\236\227\344\275\263\345\205\203/lesson1.java" "b/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\346\236\227\344\275\263\345\205\203/lesson1.java"
new file mode 100644
index 0000000000000000000000000000000000000000..e143f572c4fbfc6bb972fed11b5bb656d3cbb8fb
--- /dev/null
+++ "b/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\346\236\227\344\275\263\345\205\203/lesson1.java"
@@ -0,0 +1,68 @@
+package com.md.lesson10;
+
+import java.util.Random;
+import java.util.Scanner;
+
+public class lesson2 {
+	public static void main(String[] args) {
+		//	在主函数中接收10个数存入数组，在自定义函数中，
+		//将该数组中的最大值与第一个元素交换，
+		//最小值与最后一个元素交换，然后在主函数中输出交换后的数组
+		Scanner scan = new Scanner(System.in);
+		
+		int[] a = new int[10];
+		for (int i = 0; i < a.length; i++) {
+			a[i] = scan.nextInt();
+		}
+		
+		int max = a[0];
+		int min = a[0];
+		
+		for (int i = 1; i < a.length; i++) {
+			if (max<a[i]) {
+				max = a[i];
+			}
+			if (min>a[i]) {
+				min = a[i];
+			}
+		}
+		
+		System.out.println("转换后：");
+		for (int i = 0; i < a.length; i++) {
+			System.out.print(a[i]+"\t");
+		}
+		
+		change(max, min, a);
+		
+		System.out.println();
+		
+		System.out.println("转化后：");
+		for (int i = 0; i < a.length; i++) {
+			System.out.print(a[i]+"\t");
+		}
+	}
+	
+	public static void change(int max,int min,int[] a) {
+		int temp;
+		int maxIndex = 0;
+		int minIndex = 0;
+		
+		for (int i = 0; i < a.length; i++) {
+			if (max == a[i]) {
+				maxIndex = i;
+			}
+			if (min == a[i]) {
+				minIndex = i;
+			}
+		}
+		
+		temp = a[0];
+		a[0] = max;
+		a[maxIndex] = temp;
+		
+		temp = a[a.length-1];
+		a[a.length-1] = min;
+		a[minIndex] = temp;
+	}
+}
+
diff --git "a/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\346\236\227\344\275\263\345\205\203/lesson2.java" "b/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\346\236\227\344\275\263\345\205\203/lesson2.java"
new file mode 100644
index 0000000000000000000000000000000000000000..c85538eea798e61e0cbdd1d5ed184c0f16f9bd91
--- /dev/null
+++ "b/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\346\236\227\344\275\263\345\205\203/lesson2.java"
@@ -0,0 +1,30 @@
+package com.md.lesson10;
+
+import java.util.Random;
+import java.util.Scanner;
+
+public class lesson3 {
+
+	public static void main(String[] args) {
+		// 系统随机生成20个0~10之间的数 ，计算用户输入数在其中出现几次
+		Scanner scan = new Scanner(System.in);
+		
+		Random ran = new Random();
+		
+		int [] a = new int[20];
+		for (int i = 0; i < a.length; i++) {
+			a[i] = ran.nextInt(11);
+		}
+		System.out.println("系统生成完毕，请输入你想查询的数：");
+		int b = scan.nextInt();
+		
+		int c = 0;
+		for (int i = 0; i < a.length; i++) {
+			if (b==a[i]) {
+				c++;
+			}
+		}
+		System.out.println("该数在这二十个数中出现的次数为："+c);
+	}
+
+}
diff --git "a/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\346\236\227\344\275\263\345\205\203/lesson3.java" "b/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\346\236\227\344\275\263\345\205\203/lesson3.java"
new file mode 100644
index 0000000000000000000000000000000000000000..c3890a5126e7dbfadd12f5b1194b7de38b3f7247
--- /dev/null
+++ "b/java\347\254\254\345\215\201\346\254\241\344\275\234\344\270\232/\346\236\227\344\275\263\345\205\203/lesson3.java"
@@ -0,0 +1,30 @@
+package com.md.lesson10;
+
+	import java.util.Scanner;
+
+	public class lesson4 {
+
+		public static void main(String[] args) {
+			// 计算m的n次幂（运用函数）
+			Scanner scan = new Scanner(System.in);
+			
+			System.out.println("请输入一个数：");
+			int m = scan.nextInt();
+			
+			System.out.println("请输入这个数的幂：");
+			int n = scan.nextInt();
+			
+			int a =a(m,n);
+			System.out.println("值为："+a);
+		}
+
+		public static int a(int m, int n) {
+			// TODO Auto-generated method stub
+			int c = m ;
+			for (int i = 1; i <= n-1; i++) {
+				m *= c;
+			}
+			return m;
+		}
+
+	}