输出1到10的阶乘的和
package com.geminno.homework;
import java.util.Scanner;
public class Factorial {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入数据:");
int num = sc.nextInt();
long sum = 0;
String str = "";
for(int i=1;i<=num;i++){
sum += getJieCheng(i);
if(i == num){
str += i + "!" ;
}else {
str += i + "!" +"+";
}
}
System.out.println(str + "="+sum);
}
static long getJieCheng(int num){
long count = 1L;
for(int i=num;i>=1 ;i--){
count *= i;
}
return count;
}
}
运行结果
请输入数据:
10
1!+2!+3!+4!+5!+6!+7!+8!+9!+10!=4037913
判断回文数
package com.geminno.homework;
import java.util.Scanner;
public class TestHuiWen {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入数据:");
/*String data = sc.nextLine();
StringBuffer sb = new StringBuffer(data);
StringBuffer str = sb.reverse();//把字符串颠倒
if(data.equals(str.toString())){
System.out.println(data +"是回文数");
}*/
//charAt(index) toCharArray()
int data = sc.nextInt();
int q = 0;
int b = 0;
int s = 0;
int g = 0;
q = data/1000;
b = (data%1000)/100;
s = (data%100)/10;
g = data%10;
if(q != 0){
if(q == g && b == s){
System.out.println(data +"是回文数");
}
}else if(q == 0 && b != 0){
if(b == g){
System.out.println(data + "是回文数");
}
}else if(q == 0 && b == 0 && s != 0){
if(s == g){
System.out.println(data +"是回文数");
}
}
}
}
运行结果
请输入数据:
1221
1221是回文数
简易菜单
package com.geminno.homework;
import java.util.Scanner;
public class Work1 {
/**
* @param args
*/
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while(true){
showMenu();
System.out.println("请输入操作:");
String operator = sc.nextLine();
// /Integer.parseInt(s)
switch (operator) {
case "1":
int max = getMax(sc);
System.out.println("最大值是:"+max);
break;
case "2":
break;
case "3":
break;
case "4":
break;
case "5":
System.out.println("谢谢光临!!!");
System.exit(0);
break;
default:
System.out.println("系统操作错误,请重新输入!!!");
break;
}
}
}
static int getMax(Scanner scan){
System.out.println("请输入第一个数据:");
//String num1 = scan.nextLine();
int num1 = scan.nextInt();
System.out.println("请输入第二个参数:");
//String num2 = scan.nextLine();
int num2 = scan.nextInt();
//int max = Math.max(Integer.parseInt(num1), Integer.parseInt(num2)) ;
//int max = Integer.parseInt(num1) > Integer.parseInt(num2) ?Integer.parseInt(num1):Integer.parseInt(num2);
int max = num1 > num2 ?num1:num2;
return max;
}
static int getMin(Scanner sc){
System.out.println("请输入第一个数据:");
String num1 = sc.nextLine();
System.out.println("请输入第二个参数:");
String num2 = sc.nextLine();
//int min = Math.min(Integer.parseInt(num1), Integer.parseInt(num2)) ;
int min = Integer.parseInt(num1) < Integer.parseInt(num2) ?Integer.parseInt(num1):Integer.parseInt(num2);
return min;
}
static double getPow(Scanner sc){
System.out.println("请输入第一个数据:");
String num1 = sc.nextLine();
System.out.println("请输入第二个参数:");
String num2 = sc.nextLine();
double pow = Math.pow(Double.parseDouble(num1), Double.parseDouble(num2)) ;
return pow;
}
static double getSqrt(Scanner sc){
System.out.println("请输入第一个数据:");
String num1 = sc.nextLine();
/*System.out.println("请输入第二个参数:");
String num2 = sc.nextLine();*/
double pow = Math.sqrt(Double.parseDouble(num1)) ;
return pow;
}
static void showMenu(){
System.out.println("====欢迎使用=====");
System.out.println("1.求最大值");
System.out.println("2.求最小值");
System.out.println("3.求指数值");
System.out.println("4.求平方根");
System.out.println("5.退 出");
}
}
====欢迎使用=====
1.求最大值
2.求最小值
3.求指数值
4.求平方根
5.退 出
请输入操作:
计算个人所得税
package com.geminno.homework;
import java.util.Scanner;
public class Work2 {
/**
* @param args
*/
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入工资:");
int salary = sc.nextInt();
double tax = 0.0;
int total = salary - 3500;
if(total <= 0){
System.out.println("很遗憾,你不用交税......");
}else if(total > 0 && total <= 1500){
tax = total * 0.03;
}else if(total > 1500 && total <= 4500){
tax = (total - 1500)*0.1 + 1500 * 0.03;
}else if(total > 4500 && total <= 9000){
tax = 1500 * 0.03 + 3000*0.1 + (total - 4500)* 0.2;
}
System.out.println(tax);
}
}
请输入工资:
5000
45.0