From 9721578eb780e51572f68c4cc41f817451ae63d6 Mon Sep 17 00:00:00 2001
From: syx6666 <1551324662@qq.com>
Date: Sun, 3 Jan 2021 20:33:21 +0800
Subject: [PATCH] first commit

---
 .../L01.java"                                 | 19 +++++
 .../L02.java"                                 | 19 +++++
 .../L03.java"                                 | 25 ++++++
 .../L04.java"                                 | 79 +++++++++++++++++++
 .../L05.java"                                 | 23 ++++++
 .../L06.java"                                 | 68 ++++++++++++++++
 6 files changed, 233 insertions(+)
 create mode 100644 "Java\347\254\254\344\271\235\346\254\241\344\275\234\344\270\232/\345\225\206\350\265\242\346\227\255/L01.java"
 create mode 100644 "Java\347\254\254\344\271\235\346\254\241\344\275\234\344\270\232/\345\225\206\350\265\242\346\227\255/L02.java"
 create mode 100644 "Java\347\254\254\344\271\235\346\254\241\344\275\234\344\270\232/\345\225\206\350\265\242\346\227\255/L03.java"
 create mode 100644 "Java\347\254\254\344\271\235\346\254\241\344\275\234\344\270\232/\345\225\206\350\265\242\346\227\255/L04.java"
 create mode 100644 "Java\347\254\254\344\271\235\346\254\241\344\275\234\344\270\232/\345\225\206\350\265\242\346\227\255/L05.java"
 create mode 100644 "Java\347\254\254\344\271\235\346\254\241\344\275\234\344\270\232/\345\225\206\350\265\242\346\227\255/L06.java"

diff --git "a/Java\347\254\254\344\271\235\346\254\241\344\275\234\344\270\232/\345\225\206\350\265\242\346\227\255/L01.java" "b/Java\347\254\254\344\271\235\346\254\241\344\275\234\344\270\232/\345\225\206\350\265\242\346\227\255/L01.java"
new file mode 100644
index 0000000..7c8d4cf
--- /dev/null
+++ "b/Java\347\254\254\344\271\235\346\254\241\344\275\234\344\270\232/\345\225\206\350\265\242\346\227\255/L01.java"
@@ -0,0 +1,19 @@
+
+public class L01 {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner scanner=new Scanner(System.in);
+		int a;
+		System.out.println("请输入高");
+		a=scanner.nextInt();
+		for (int i = 1; i <= a; i++) {
+			for (int j = 1; j <= 2*(a-i)+1; j++) {
+				System.out.print("*");
+			}
+			System.out.println();
+		}
+
+	}
+
+}
diff --git "a/Java\347\254\254\344\271\235\346\254\241\344\275\234\344\270\232/\345\225\206\350\265\242\346\227\255/L02.java" "b/Java\347\254\254\344\271\235\346\254\241\344\275\234\344\270\232/\345\225\206\350\265\242\346\227\255/L02.java"
new file mode 100644
index 0000000..8e64974
--- /dev/null
+++ "b/Java\347\254\254\344\271\235\346\254\241\344\275\234\344\270\232/\345\225\206\350\265\242\346\227\255/L02.java"
@@ -0,0 +1,19 @@
+
+public class L02 {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner scanner=new Scanner(System.in);
+		int a;
+		System.out.println("请输入高");
+		a=scanner.nextInt();
+		for (int i = 1; i <= a; i++) {
+			for (int j = 1; j <= 2*i-1; j++) {
+				System.out.print("*");
+			}
+			System.out.println();
+		}
+
+	}
+
+}
diff --git "a/Java\347\254\254\344\271\235\346\254\241\344\275\234\344\270\232/\345\225\206\350\265\242\346\227\255/L03.java" "b/Java\347\254\254\344\271\235\346\254\241\344\275\234\344\270\232/\345\225\206\350\265\242\346\227\255/L03.java"
new file mode 100644
index 0000000..42c7058
--- /dev/null
+++ "b/Java\347\254\254\344\271\235\346\254\241\344\275\234\344\270\232/\345\225\206\350\265\242\346\227\255/L03.java"
@@ -0,0 +1,25 @@
+public class L03 {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		int a[]= {20,30,40,50,789,};
+		
+		 System.out.println("最大值是"+p(a));
+
+	}
+	public static int p(int []a) {
+		int max= a [0];
+		for (int i = 1; i < a.length; i++) {
+			if (max<a[i]) {
+				max=a[i];
+			}
+		}
+		return max;
+		
+		
+	
+	
+	}
+	}
+
+
diff --git "a/Java\347\254\254\344\271\235\346\254\241\344\275\234\344\270\232/\345\225\206\350\265\242\346\227\255/L04.java" "b/Java\347\254\254\344\271\235\346\254\241\344\275\234\344\270\232/\345\225\206\350\265\242\346\227\255/L04.java"
new file mode 100644
index 0000000..9202dec
--- /dev/null
+++ "b/Java\347\254\254\344\271\235\346\254\241\344\275\234\344\270\232/\345\225\206\350\265\242\346\227\255/L04.java"
@@ -0,0 +1,79 @@
+public class L04 {
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner scan = new Scanner(System.in);
+		
+		System.out.println("请选择算法");
+		System.out.println("加法");
+		System.out.println("减法");
+		System.out.println("乘法");
+		System.out.println("除法");
+		System.out.println("求余");
+		String a = scan.next();
+while (true) {
+	
+
+		switch (a) {
+		case "+":
+			System.out.println("请输入数据");
+			int b =scan.nextInt();
+			int c =scan.nextInt();
+			System.out.println("结果是"+jiafa( b,  c));
+			
+			break;
+		case "-":
+			System.out.println("请输入数据");
+			int d =scan.nextInt();
+			int e =scan.nextInt();
+			System.out.println("结果是"+jianfa( d,  e));
+			break;
+		case "*":
+			System.out.println("请输入数据");
+			int j =scan.nextInt();
+			int k =scan.nextInt();
+			System.out.println("结果是"+chenfa(j,k));
+			break;
+		case "/":
+			System.out.println("请输入数据");
+			int w =scan.nextInt();
+			int y =scan.nextInt();
+			System.out.println("结果是"+chufa(w,y));
+			break;
+		case "%":
+			System.out.println("请输入数据");
+			int f =scan.nextInt();
+			int g =scan.nextInt();
+			System.out.println("结果是"+qiuyu(f,g));
+			break;
+
+		default:
+			System.out.println("滚蛋数据错误无法接受");
+			return;
+			
+		}
+		
+}
+	}
+	public static int jiafa(int a,int b) {
+		
+		return a+b;
+	}
+	public static int jianfa(int a,int b) {
+		
+		return a-b;
+	}
+	public static int chenfa(int a,int b) {
+		
+		return a*b;
+	}
+	public static int chufa(int a,int b) {
+		
+		return a/b;
+	}
+	public static int qiuyu(int a,int b) {
+		
+		return a%b;
+	}
+	
+
+}
diff --git "a/Java\347\254\254\344\271\235\346\254\241\344\275\234\344\270\232/\345\225\206\350\265\242\346\227\255/L05.java" "b/Java\347\254\254\344\271\235\346\254\241\344\275\234\344\270\232/\345\225\206\350\265\242\346\227\255/L05.java"
new file mode 100644
index 0000000..480e147
--- /dev/null
+++ "b/Java\347\254\254\344\271\235\346\254\241\344\275\234\344\270\232/\345\225\206\350\265\242\346\227\255/L05.java"
@@ -0,0 +1,23 @@
+public class L05 {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner scanner = new Scanner(System.in);
+		System.out.println("请输入阶乘数");
+		int a=scanner.nextInt();
+		int b=0;
+		int c=1;
+		int d=0;
+		for (int i = 1; i <= a; i++) {
+			for (int j = 1; j <= i; j++) {
+				b=j;
+			}
+			c=b*c;
+			d=d+c;
+			System.out.println(" "+c);
+		}
+		
+System.out.println("结果是"+d);
+	}
+
+}
diff --git "a/Java\347\254\254\344\271\235\346\254\241\344\275\234\344\270\232/\345\225\206\350\265\242\346\227\255/L06.java" "b/Java\347\254\254\344\271\235\346\254\241\344\275\234\344\270\232/\345\225\206\350\265\242\346\227\255/L06.java"
new file mode 100644
index 0000000..ec4f9e3
--- /dev/null
+++ "b/Java\347\254\254\344\271\235\346\254\241\344\275\234\344\270\232/\345\225\206\350\265\242\346\227\255/L06.java"
@@ -0,0 +1,68 @@
+public class L05 {
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+Scanner scan = new Scanner(System.in);
+		
+		System.out.println("请选择算法");
+		System.out.println("正方形");
+		System.out.println("长方形");
+		System.out.println("三角形");
+		System.out.println("圆形");
+		String a = scan.next();
+while (true) {
+	
+
+		switch (a) {
+		case "1":
+			System.out.println("请输入数据");
+			int b =scan.nextInt();
+			
+			System.out.println("结果是"+jiafa( b));
+			
+			break;
+		case "2":
+			System.out.println("请输入数据");
+			int d =scan.nextInt();
+			int e =scan.nextInt();
+			System.out.println("结果是"+jianfa( d,  e));
+			break;
+		case "3":
+			System.out.println("请输入数据");
+			int j =scan.nextInt();
+			int k =scan.nextInt();
+			System.out.println("结果是"+chenfa(j,k));
+			break;
+		case "4":
+			System.out.println("请输入数据");
+			double w =scan.nextDouble();
+			double y =scan.nextDouble();
+			System.out.println("结果是"+chufa(w,y));
+			break;
+		default:
+			System.out.println("滚蛋数据错误无法接受");
+			return;
+			
+		}
+		
+}
+	}
+	public static int jiafa(int a) {
+		
+		return a*a;
+	}
+	public static int jianfa(int a,int b) {
+		
+		return a*b;
+	}
+	public static int chenfa(int a,int b) {
+		
+		return a*b/2;
+	}
+	public static double chufa(double a,double b) {
+		
+		return ((a*b)*3.14);
+	}
+
+	}
+
+
-- 
Gitee