diff --git "a/\346\226\271\346\263\225\347\273\203\344\271\240/\346\226\271\350\215\243\346\230\237/Domo01.java" "b/\346\226\271\346\263\225\347\273\203\344\271\240/\346\226\271\350\215\243\346\230\237/Domo01.java"
new file mode 100644
index 0000000000000000000000000000000000000000..6b155615c2f3563e7be35a8e159e6382804eb4dc
--- /dev/null
+++ "b/\346\226\271\346\263\225\347\273\203\344\271\240/\346\226\271\350\215\243\346\230\237/Domo01.java"
@@ -0,0 +1,21 @@
+package fang;
+
+public class Domo01 {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		int[] array = {80,20,30};
+		int max=fan(array);
+		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;
+}
+}
diff --git "a/\346\226\271\346\263\225\347\273\203\344\271\240/\346\226\271\350\215\243\346\230\237/Domo02.java" "b/\346\226\271\346\263\225\347\273\203\344\271\240/\346\226\271\350\215\243\346\230\237/Domo02.java"
new file mode 100644
index 0000000000000000000000000000000000000000..393c2c54cf0bcc91cfe22ae70bcb92c44c8128e4
--- /dev/null
+++ "b/\346\226\271\346\263\225\347\273\203\344\271\240/\346\226\271\350\215\243\346\230\237/Domo02.java"
@@ -0,0 +1,17 @@
+package fang;
+
+public class Domo02 {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+//需求：设计一个方法用于数组遍历，要求遍历的结果是打印输出在一行上的。
+		//例如：[11, 22, 33, 44, 55] 
+		int[] array ={11,22,33,44,55};
+		bian(array);
+	}
+public static void bian(int[] a) {
+	for (int i = 0; i < a.length; i++) {
+		System.out.print(a[i]+",");
+	}
+}
+}
diff --git "a/\346\226\271\346\263\225\347\273\203\344\271\240/\346\226\271\350\215\243\346\230\237/Domo03.java" "b/\346\226\271\346\263\225\347\273\203\344\271\240/\346\226\271\350\215\243\346\230\237/Domo03.java"
new file mode 100644
index 0000000000000000000000000000000000000000..8b101b44c3a3354c98b7d865b52ce26e5057f67c
--- /dev/null
+++ "b/\346\226\271\346\263\225\347\273\203\344\271\240/\346\226\271\350\215\243\346\230\237/Domo03.java"
@@ -0,0 +1,35 @@
+package fang;
+
+public class Domo03 {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+//		- 需求：设计一个方法，该方法能够同时获取数组的最大值，和最小值
+//
+//		- 注意: return语句, 只能带回一个结果.
+//
+//		- 提示:返回一个数组，数组里第一个元素是最大值，第二个元素是最小值
+		int[] array = {80,20,30};
+		int [] acc=fan(array);
+		for (int i = 0; i < acc.length; i++) {
+			System.out.println(acc[i]);	
+		}
+		
+	}
+	public static int[] fan(int[] a){
+		int [] fanhui = new int[2];
+		int max=a[0];
+		int min=a[0];
+		for (int i = 0; i < a.length; i++) {
+			if (max<a[i]) {
+				max=a[i];
+			}
+			if (min>a[i]) {
+				min=a[i];
+			}
+		}
+		fanhui[0]=max;
+		fanhui[1]=min;
+		return fanhui;
+	}
+}
diff --git "a/\346\226\271\346\263\225\347\273\203\344\271\240/\346\235\250\345\270\206/Demo02.java" "b/\346\226\271\346\263\225\347\273\203\344\271\240/\346\235\250\345\270\206/Demo02.java"
index 012ad9f3b89fd7f2ec64e3e6e728608af3828e4c..b62a684e2505c8a1e5278c13473df946b519eb29 100644
--- "a/\346\226\271\346\263\225\347\273\203\344\271\240/\346\235\250\345\270\206/Demo02.java"
+++ "b/\346\226\271\346\263\225\347\273\203\344\271\240/\346\235\250\345\270\206/Demo02.java"
@@ -6,42 +6,33 @@ public class Demo02 {
 		Random abc = new Random();
 		
 		int arr[] = new int [10];
+		int ab [] = new int [2];
 		for (int i = 0; i < arr.length; i++) {
 			arr[i] = abc.nextInt(100);
 		}
-		index(arr);
-		for (int i = 0; i < arr.length; i++) {
-			System.out.print(arr[i]+" ");
+		index(arr,ab);
+		for (int i = 0; i < 2; i++) {
+			System.out.print(ab[i]+" ");
 		}
 		
 	}
 	
-	public static int[] index (int arr[]) {
+	public static int[] index (int arr[], int ab[]) {
 		
 		int max = arr[0];
 		int min = arr[0];
-		int maxindex = 1;
-		int minindex = 2;
-		int a = 0;
-		int b = 0;
+		
 		
 		for (int i = 0; i < arr.length; i++) {
 			if(arr[i] > max) {
 				max = arr[i];
-				maxindex = i;
-				a = arr[0];
-				arr[0] = max;
-				arr[0] = arr[maxindex];
-				
 			}
 			if(arr[i] < min) {
 				min = arr[i];
-				minindex = i;
-				b = arr[1];
-				arr[1] = min;
-				arr[1] = arr[minindex];
 			}
 		}
-		return arr;
+		ab[0] = max;
+		ab[1] = min;
+		return ab;
 	}
 }