diff --git "a/\346\226\271\346\263\225\347\273\203\344\271\240/\351\237\246\345\244\251\347\277\224/Demo1.java" "b/\346\226\271\346\263\225\347\273\203\344\271\240/\351\237\246\345\244\251\347\277\224/Demo1.java"
new file mode 100644
index 0000000000000000000000000000000000000000..a8a0ed0d7149b97114b18f4da745c55ad296b697
--- /dev/null
+++ "b/\346\226\271\346\263\225\347\273\203\344\271\240/\351\237\246\345\244\251\347\277\224/Demo1.java"
@@ -0,0 +1,18 @@
+
+public class Demo1 {
+
+	public static void main(String[] args) {
+	int [] arr = {1,2,3,4,5,6,7,8,9};
+
+	System.out.println(big(arr));
+	}
+	public static int big(int [] arr) {
+		int max = 0;
+		for(int i=0;i<arr.length;i++) {
+			if(arr[i]>max) {
+				max=arr[i];
+			}
+		}
+		return max;
+	}
+}
diff --git "a/\346\226\271\346\263\225\347\273\203\344\271\240/\351\237\246\345\244\251\347\277\224/Demo2.java" "b/\346\226\271\346\263\225\347\273\203\344\271\240/\351\237\246\345\244\251\347\277\224/Demo2.java"
new file mode 100644
index 0000000000000000000000000000000000000000..b4b331107d6518c5fc2306779b6167a0ccc9d101
--- /dev/null
+++ "b/\346\226\271\346\263\225\347\273\203\344\271\240/\351\237\246\345\244\251\347\277\224/Demo2.java"
@@ -0,0 +1,16 @@
+
+public class Demo2 {
+
+	public static void main(String[] args) {
+		int [] arr = {1,2,3,4,5,6,7,8,9,10};
+		dig(arr);
+
+	}
+	public static void dig(int []arr){
+		for(int i =0;i<arr.length;i++) {
+			System.out.print(arr[i]);
+			System.out.print("|");
+		}
+	}
+
+}
diff --git "a/\346\226\271\346\263\225\347\273\203\344\271\240/\351\237\246\345\244\251\347\277\224/Demo3.java" "b/\346\226\271\346\263\225\347\273\203\344\271\240/\351\237\246\345\244\251\347\277\224/Demo3.java"
new file mode 100644
index 0000000000000000000000000000000000000000..422db47f6c39ac4f78f7bb2c8ae111d5fed519af
--- /dev/null
+++ "b/\346\226\271\346\263\225\347\273\203\344\271\240/\351\237\246\345\244\251\347\277\224/Demo3.java"
@@ -0,0 +1,31 @@
+
+public class Demo3 {
+
+	public static void main(String[] args) {
+		int [] arr = {1,2,3,4,5,6,7,8,9,10};
+		bigandxiao(arr);
+		int max =bigandxiao(arr)[0];
+		int min =bigandxiao(arr)[1];
+		System.out.println("数组中最大数为"+max);
+		System.out.println("数组中最小数为"+min);
+
+	}
+	public static int[] bigandxiao(int [] arr) {
+		int max=arr[0];
+		int min=arr[0];
+		for(int x=0;x<arr.length;x++) {
+			if(max>arr[x]) {
+				arr[x]=max;
+			}
+		for(int y=0;y<arr.length;y++) {
+			if(min<arr[y]) {
+				min=arr[y];
+			}
+		}
+		}
+		int [] add = new  int [2];
+		add[0]= max;
+		add[1]= min;
+		return add;
+	}
+}