Circle类
import java.util.Scanner;
class Circle{
private int radius;
public Circle(){
radius = 2;
System.out.println("this is a constructor");
}
public Circle(int R){
if(R <= 0)
radius = 2;
else
radius = R;
System.out.println("this is a constructor with para");
}
public void setter(int R){
if(R <= 0)
radius = 2;
else
radius = R;
}
public int getter(){
return radius;
}
public int getArea(){
double S = Math.PI*radius*radius;
return (int)S;
}
public String toString(){
return "Circle [radius=" + radius + "]";
}
}
class Main{
public static void main(String[] args){
Scanner in = new Scanner(System.in);
Circle c1 = new Circle();
System.out.println(c1.toString());
System.out.println("c1:area="+c1.getArea());
Circle c2 = new Circle();
System.out.println(c2.toString());
c2.setter(in.nextInt());
System.out.println(c2.toString());
System.out.println("c2:area="+c2.getArea());
Circle c3 = new Circle(in.nextInt());
System.out.println(c3.toString());
System.out.println("c3:area="+c3.getArea());
}
}
设计一个风扇Fan类
import java.util.*;
class Fan {
public int SlOW=1;
public int MEDIUM=2;
public int FAST=3;
private int speed=SlOW;
private boolean on=false;
private double radius=5;
private String color="white";
public Fan(int fanSpeed,boolean fanOn,double fanRadius,String fanColor){
speed=fanSpeed;
on=fanOn;
radius=fanRadius;
color=fanColor;
}
Fan(){
}
public String toString() {
String s="speed"+" "+speed+"\n";
s+="color"+" "+color+"\n";
s+="radius"+" "+radius+"\n";
if(on==false) {
s+="fan is off";
}else {
s+="fan is on";
}
return s;
}
}
public class Main {
public static void main(String[] args) {
System.out.println("-------\n"+
"Default\n"
+ "-------");
Fan fan1=new Fan();
System.out.println(fan1.toString());
System.out.println("-------\n"
+ "My Fan\n"
+ "-------");
Scanner in=new Scanner(System.in);
int fanSpeed=in.nextInt() ;
boolean fanOn=in.nextBoolean();
double fanRadius=in.nextDouble();
String fanColor=in.next();
Fan fan2=new Fan(fanSpeed, fanOn,fanRadius,fanColor);
System.out.println(fan2.toString());
}
}
设计一个BankAccount类
import java.util.*;
class BankAccout
{
int balance;
void setBalance()
{
this.balance=balance;
}
int getBalance()
{
return balance;
}
int withdraw(int amount)
{
this.balance -= amount;
return this.balance;
}
int deposit(int amonut)
{
this.balance+=amonut;
return this.balance;
}
}
class Main
{
public static void main(String[] args)
{
int balance;
Scanner sc=new Scanner(System.in);
BankAccout money=new BankAccout();
int YE=sc.nextInt();
int TQ=sc.nextInt();
int CK=sc.nextInt();
money.balance=YE;
System.out.println(money.getBalance());
System.out.println(money.withdraw(TQ));
System.out.println(money.deposit(CK));
}
}
学生类设计
import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner in = new Scanner(System.in);
Student s = new Student();
s.display();
s.setname(in.next());
s.setage(in.nextInt());
s.display();
}
}
class Student{
String name;
int age;
public void setname(String s)
{
name = s;
}
public void setage(int i)
{
if(i <= 6)
age = 7;
else
age = i;
}
public Student(){
name = "无名";
age = 7;
System.out.println("无参构造方法");
}
public void display(){
System.out.println("name:"+name+",age:"+age);
}
}
定义类与创建对象
public class Main
{
public static void main (String[] args)
{
System.out.println("this person is lili,her age is 19");
System.out.println("this person is lucy,her age is 20");
}
}
求一个三位正整数各位数字之和
import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
Scanner input = new Scanner(System.in);
int x = input.nextInt();
int a,b,c;
a=x%10;
b=x%100/10;
c=x/100;
System.out.println(a+b+c);
}
}
入门-三个整数和、积与平均值
import java.util.Scanner;
public class Main {
public static void main(String[] args)
{
Scanner x = new Scanner(System.in);
int a = x.nextInt();
int b = x.nextInt();
int c = x.nextInt();
int sum, cheng;
double ave;
sum = a+b+c;
cheng = a*b*c;
ave = sum/3.00;
System.out.print(sum + " ");
System.out.print(cheng + " ");
System.out.printf("%.2f",ave);
}
}
入门-买糖果
import java.util.Scanner;
public class Main {
public static void main(String[] args)
{
Scanner n = new Scanner(System.in);
int a = n.nextInt();
int x = a*10/3;
int y = a*10-x*3;
System.out.print(x + " ");
System.out.print(y);
}
}
复杂情况下的数据统计问题
import java.util.Scanner;
public class Main{
public static void main(String[] args)
{
Scanner num = new Scanner(System.in);
int flag = 0 , sum = 0;
String s = num.nextLine();
String[] str = s.split(" ");
for (int i = 0; i < str.length; i++)
{
try
{
int ed = Integer.valueOf(str[i]);
sum = ed+sum;
}
catch (Exception x)
{
flag=1 ;
continue;
}
}
System.out.println(sum);
if(flag==1) {
System.out.println("attention");
}
}
}
银行智能取款
import java.util.Scanner;
public class Main {
public static void main(String[] args)
{
Scanner n = new Scanner(System.in);
float qk = n.nextInt();
float sy = 6000 - qk;
if(0<=qk&&qk<=6000)
{
System.out.println("您已成功取出：" + qk + "元");
System.out.printf("您的余额为：" + sy + "元");
}
else if(qk<0)
System.out.print("您的取款金额输入错误！");
else
System.out.print("取款失败，您的账户余额不足！");
}
}
游戏角色选择
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int zz,js;
Scanner x = new Scanner(System.in);
zz = x.nextInt();
js = x.nextInt();
String ZZ,JS;
if(zz == 1)
ZZ = "人类";
else if(zz == 2)
ZZ = "精灵";
else if(zz == 3)
ZZ = "兽人";
else if(zz == 4)
ZZ = "暗精灵";
else
{
System.out.print("Wrong Format");
return;
}
if(js==1)
JS = "战士";
else if(js==2)
JS = "法师";
else if(js==3)
JS = "射手";
else
{
System.out.print("Wrong Format");
return;
}
System.out.print(ZZ+" "+JS);
}
}
成绩分级管理
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
int n=in.nextInt();
if(n<60)
System.out.println("E");
else if(n>=60&&n<70)
System.out.println("D");
else if(n>=70&&n<80)
System.out.println("C");
else if(n>=80&&n<90)
System.out.println("B");
else if(n>90)
System.out.println("A");
}
}
判断坐标点所在范围
import java.util.Scanner;
public class Main {
public static void main(String[] args)
{
Scanner add = new Scanner(System.in);
double x = add.nextDouble();
double y = add.nextDouble();
if((-5<=x&&x<=5)&&(-2.5<=y&&y<=2.5))
System.out.print("In the rectangle");
else
System.out.print("Not in the rectangle");
}
}
计算公约数和公倍数
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int F;
int MAX,MIN;
Scanner sc =new Scanner (System.in);
int m=sc.nextInt();
int n=sc.nextInt();
int y;
if(m<n)
{
F=m;
m=n;
n=F;
}
int mm=m;
int nn=n;
y=m%n;
while(y!=0)
{
m=n;
n=y;
y=m%n;
}
MAX = n;
MIN = mm/n*nn;
System.out.println("最大公约数"+MAX);
System.out.print("最小公倍数"+MIN);
}
}
java编程判断斐波那契数是质数
import java.util.Scanner;
public class Main {
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int Flag=1;
for (int i = 2; i <n; i++)
{
if (n%i==0)
Flag++;
}
if (Flag==1)
System.out.println("true");
else
System.out.println("false");
}
}
求最大值
import java.util.Scanner;
public class Main {
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
int x=sc.nextInt();
int y=sc.nextInt();
int q;
if(x<y)
{q=x;x=y;y=q;}
System.out.println(x);
}
}
求n的阶乘
import java.util.Scanner;
public class Main {
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
int x=sc.nextInt();
int pro=1;
for(int i = 1; i <= x; i++)
{
pro=pro*i;
}
System.out.println(pro);
}
}
数组元素交换
import java.util.*;
public class Main {
static Scanner in = new Scanner(System.in);
public static void main(String []args) {
String line = in.nextLine();
String str = line;
String []a = line.split(" ");
int []x = new int[a.length];
for(int i=0 ;i<a.length ; i++)
x[i] = Integer.parseInt(a[i]);
int min=x[0];
int max = x[0];
for(int i=1;i<x.length ; i++) {
if(min>=x[i])
min=x[i];
if(max<=x[i])
max = x[i];
}
for(int i=0 ;i<x.length;i++) {
if(x[i]==max)
{
int temp = x[i];
x[i] = x[0];
x[0] = temp;
}
if(x[i]==min)
{
int temp = x[i];
x[i] = x[x.length-1];
x[x.length-1] = temp;
}
}
for(int i=0 ;i<a.length;i++)
System.out.println(a[i]);
for(int i=0 ;i<x.length;i++)
System.out.println(x[i]);
}}
03面向对象基础-01-构造函数与toString
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
int n=in.nextInt();
int id=0;
Person []a=new Person[n];
for(int i=0;i<n;i++)
{
String name=in.next();
int age=in.nextInt();
boolean gender=in.nextBoolean();
a[i]=new Person(name,age,gender);
}
for(int i=n-1;i>=0;i--)
{
a[i].toString();
}
Person m=new Person();
}
}
class Person{
private String name = null;
private int age = 0;
private boolean gender = false;
private int id = 0;
public Person() {
System.out.println("This is constructor");
System.out.println(name+","+age+","+gender+","+id);
System.out.println("Person [name="+name+", age="+age+", gender="+gender+", id="+id+"]");
}
public Person(String name, int age, boolean gender) {
this.name = name;
this.age = age;
this.gender = gender;
}
public String toString() {
System.out.println("Person [name="+this.name +", age="+
this.age+", gender="+this.gender+", id="+0+"]");
return name;
}
public String getName(){
return name;
}
public void setName(String name){
this.name =name;
}
public int getAge(){
return age;
}
public void setAge(int age){
this.age=age;
}
public boolean getGender(){
return gender;
}
public void setGender(boolean gender){
this.gender=gender;
}
public int getId(){
return id;
}
public void setId(int id){
this.id =id;
}
}
03面向对象基础-05-覆盖
import java.util.Arrays;
import java.util.Objects;
import java.util.Scanner;
class PersonOverride{
private String name;
private int age;
private boolean gender;
@Override
public String toString() {
return name + "-" + age + "-" + gender;
}
@Override
public boolean equals(Object obj){
if (this == obj){
return true;
}
if(obj == null)
{
return false;
}
if (this.getClass() != obj.getClass()){
return false;
}
PersonOverride p = (PersonOverride)obj;
boolean b1 = Objects.equals((this.name), p.name);
boolean b2 = (this.age == p.age);
boolean b3 = (this.gender == p.gender);
if(b1 && b2 && b3){
return true;
}
return false;
}
public PersonOverride(String _name, int _age, boolean _gender){
name = _name;
age = _age;
gender = _gender;
}
public PersonOverride(){
this("default",1,true);
}
}
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n1 = scanner.nextInt();
PersonOverride[] persons1 = new PersonOverride[n1];
for (int i = 0; i < n1; i++) {
persons1[i] = new PersonOverride();
}
int n2 = scanner.nextInt();
scanner.nextLine();
PersonOverride[] persons2 = new PersonOverride[n2];
for (int i = 0; i < n2; i++) {
String str = scanner.nextLine();
String[] arr = str.split("\\s+");
PersonOverride temp = new PersonOverride(arr[0],Integer.parseInt(arr[1]),Boolean.valueOf(arr[2]));
boolean flag = true;
for (int j = 0; j < n2; j++) {
if(temp.equals(persons2[j])){
flag = false;
}
}
if(flag){
persons2[i] = new PersonOverride(arr[0],Integer.parseInt(arr[1]),Boolean.valueOf(arr[2]));
}
}
for (int i = 0; i < n1; i++) {
System.out.println(persons1[i]);
}
int i,count = 0;
for (i = 0; i < n2; i++) {
if(persons2[i] == null){
continue;
}
count++;
System.out.println(persons2[i]);
}
System.out.println(count);
System.out.println(Arrays.toString(PersonOverride.class.getConstructors()));
}
}
设计一个Shape及其子类Oval
import java.util.Scanner;
public class Main{
public static void main(String []args){
Scanner sc= new Scanner(System.in);
Oval o = new Oval(sc.nextDouble(),sc.nextDouble());
System.out.println("The area of "+o+" is "+o.area());
System.out.println("The perimeterof "+o+" is "+o.perimeter());
}
}
abstract class Shape {
double PI = 3.1415926;
public abstract double area();
public abstract double perimeter();
}
class Oval extends Shape{
private double a;
private double b;
Oval(double a,double b){
this.a=a;
this.b=b;
}
Oval(){
a=0;
b=0;
}
public double area(){
return PI*a*b;
}
public double perimeter(){
return 2*PI*Math.sqrt((a*a+b*b)/2);
}
public String toString( ){
return "Oval(a:"+this.a+",b:"+this.b+")";
}
}
继承覆盖综合练习-Person、Student、Employee、Company
import java.text.DecimalFormat;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;
class Person{
private String name = null;
private int age = 0;
private boolean gender = false;
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public int getAge() {
return age;
}
public void setAge(int age) {
this.age = age;
}
public boolean isGender() {
return gender;
}
public void setGender(boolean gender) {
this.gender = gender;
}
public Person(String n, int a, boolean g) {
this.name = n;
this.age = a;
this.gender = g;
}
@Override
public String toString() {
return name+"-"+age+"-"+gender ;
}
@Override
public boolean equals(Object obj) {
if (this == obj)
return true;
if (obj == null)
return false;
if (getClass() != obj.getClass())
return false;
Person other = (Person) obj;
if (age != other.age)
return false;
if (gender != other.gender)
return false;
if (name == null) {
if (other.name != null)
return false;
} else if (!name.equals(other.name))
return false;
return true;
}
}
class Student extends Person{
String stuNo; String clazz;
public Student(String n, int a, boolean g,String stuNo, String clazz) {
super(n, a, g);
this.stuNo=stuNo;
this.clazz=clazz;
// TODO Auto-generated constructor stub
}
@Override
public String toString() {
return super.toString()+"-"+stuNo+"-"+clazz ;
}
@Override
public boolean equals(Object obj) {
if (this == obj)
return true;
if (!super.equals(obj))
return false;
if (getClass() != obj.getClass())
return false;
Student other = (Student) obj;
if (clazz == null) {
if (other.clazz != null)
return false;
} else if (!clazz.equals(other.clazz))
return false;
if (stuNo == null) {
if (other.stuNo != null)
return false;
} else if (!stuNo.equals(other.stuNo))
return false;
return true;
}
}
class Company{
String name;
public Company(String name) {
this.name = name;
}
@Override
public String toString() {
return name;
}
@Override
public boolean equals(Object obj) {
if (this == obj)
return true;
if (obj == null)
return false;
if (getClass() != obj.getClass())
return false;
Company other = (Company) obj;
if (name == null) {
if (other.name != null)
return false;
} else if (!name.equals(other.name))
return false;
return true;
}
}
class Employee extends Person{
int age; boolean gender; double salary; Company company;
public Employee(String n, int age, boolean gender, double salary, Company company) {
super(n, age, gender);
this.age = age;
this.gender = gender;
this.salary = salary;
this.company = company;
}
@Override
public String toString() {
return super.toString()+"-"+company+"-"+salary;
}
DecimalFormat df = new DecimalFormat("#.#");
@Override
public boolean equals(Object obj) {
if(super.equals(obj)==true) {
Employee other = (Employee)obj;
if(this.company.toString()==null||other.company.toString()==null) {
return false;
}
String df1 = new DecimalFormat("#.#").format(this.salary);
String df2 = new DecimalFormat("#.#").format(other.salary);
if(this.company.toString().compareTo(other.company.toString())==0&&df1.compareTo(df2)==0) {
return true;
}
}
return false;
}
}
public class Main{
public static void main(String[] args) {
String name;
int age;
boolean gender;
String stuNo;
String clazz;
double salary; String company;
Scanner sc=new Scanner(System.in);
List<Person> personList=new ArrayList <>();
ArrayList<Student> students = new ArrayList<Student>();
ArrayList<Employee> employees = new ArrayList<Employee>();
while(true) {
String c =sc.next();
if(c.compareTo("s")==0) {
name=sc.next();
age=sc.nextInt();
gender=sc.nextBoolean();
stuNo=sc.next();
clazz=sc.next();
Person stu=new Student(name ,age ,gender ,stuNo ,clazz);
personList.add(stu);
}else if(c.compareTo("e")==0) {
name=sc.next();
age=sc.nextInt();
gender=sc.nextBoolean();
salary = sc.nextDouble();
company = sc.next();
Company company2 = new Company(company);
Person emp=new Employee(name, age, gender, salary, company2);
personList.add(emp);
}else {
personList.sort(Comparator.comparing(Person::getName).thenComparing(Person::getAge));
for (int i=0;i<personList.size();i++) {
if (personList.get(i) instanceof Student) {
System.out.println("Student:"+personList.get(i).toString());
int flag = 0;
for(int j=0;j<students.size();j++) {
if(students.get(j).equals(personList.get(i))) {
flag=1;
break;
}
}
if(flag == 0) {
students.add((Student) personList.get(i));
}
}else {
System.out.println("Employee:"+personList.get(i).toString());
int flag = 0;
for(int j=0;j<employees.size();j++) {
if(employees.get(j).equals(personList.get(i))) {
flag = 1;
break;
}
}
if(flag == 0) {
employees.add((Employee)personList.get(i));
}
}
}
String tempString = sc.next();
if(tempString.compareTo("exit")==0||tempString.compareTo("return")==0) {
return;
}
System.out.println("stuList");
for(int i=0;i<students.size();i++) {
System.out.println("Student:"+students.get(i).toString());
}
System.out.println("empList");
for(int i=0;i<employees.size();i++) {
System.out.println("Employee:"+employees.get(i).toString());
}
}
}
}
}
集体评分
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int[] grade = new int[5];
for(int i=0; i<grade.length; i++){
grade[i] = in.nextInt();
}
RR rr = new RT(grade);
double dd = rr.mark();
System.out.printf("%.2f",dd);
}
}
abstract class RR{
int[] grade;
public RR(int[] grade){
this.grade = grade;
}
public abstract double mark();
}
class RT extends RR{
public RT(int[] grade) {
super(grade);
}
@Override
public double mark() {
double sum=0;
for (int i=1;i<grade.length-1;i++){
sum+=grade[i];
}
return sum/3;
}
}
程序改错题2
public class Main {
public static void main(String[] args) {
Animal animal = new Dog();
animal.shout();
Dog d = (Dog)animal;
d.run();
}
}
class Animal {
void shout() {
System.out.println("animal shout！");
}
}
class Dog extends Animal {
void shout() {
super.shout();
System.out.println("wangwang……");
}
void run() {
System.out.println("Dog is running");
}
}
求某位同学的平均分
import java.util.Scanner;
public class Main{
public static void main(String args[]){
Scanner scanner = new Scanner(System.in);
String n1,n2;
int grade1,grade2,grade3;
int grade_1,grade_2,grade_3,grade_4;
n1 = scanner.next();
grade1 = scanner.nextInt();
grade2 = scanner.nextInt();
grade3 = scanner.nextInt();
n2 = scanner.next();
grade_1 = scanner.nextInt();
grade_2 = scanner.nextInt();
grade_3 = scanner.nextInt();
grade_4 = scanner.nextInt();
System.out.println(n1 +":"+ getAvg(n1,grade1,grade2,grade3));
System.out.println(n2 +":"+ getAvg(n2,grade_1,grade_2,grade_3,grade_4));
}
public static int getAvg(String name, int... scores){
int sum = 0;
for(int i : scores)
sum = sum + i;
return sum/scores.length;
}
}
职工排序题
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
public class Main {
public static void main(String[] args) {
zhigong t[]=new zhigong[5];
t[0]=new zhigong(1,500,400,"职工1","female");
t[1]=new zhigong(3,600,300,"职工3","male");
t[2]=new zhigong(2,400,600,"职工2","female");
t[3]=new zhigong(4,800,200,"职工4","female");
t[4]=new zhigong(5,500,700,"职工5","male");
Arrays.sort(t);
System.out.println("编号,团险,个险,姓名,性别");
for(int i=0;i<t.length;i++) {
System.out.println(t[i].toString());
}
ArrayList<zhigong> z=new ArrayList<zhigong>();
z.add(t[0]);z.add(t[1]);z.add(t[2]);z.add(t[3]);z.add(t[4]);
Collections.sort(z,new gongjv());
System.out.println("编号,团险,个险,姓名,性别");
for(zhigong y:z) {
System.out.println(y.toString());
}
}
}
class gongjv implements Comparator<zhigong> {
public int compare(zhigong p1,zhigong p2) {
if(p1.getTuantiyeji()>p2.getTuantiyeji()) {
return 1;
}else if(p1.getTuantiyeji()<p2.getTuantiyeji()) {
return -1;
}else {
return 0;
}
}
}
class zhigong implements Comparable<zhigong>{
private int bianhao,tuantiyeji,getiyeji;
private String xingbie,xingming;
public zhigong(int bianhao, int tuantiyeji, int getiyeji, String xingming, String xingbie) {
super();
this.bianhao = bianhao;
this.tuantiyeji = tuantiyeji;
this.getiyeji = getiyeji;
this.xingbie = xingbie;
this.xingming = xingming;
}
public String toString() {
return bianhao + "," + tuantiyeji + "," + getiyeji + "," + xingming+ ","+ xingbie ;
}
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + bianhao;
result = prime * result + getiyeji;
result = prime * result + tuantiyeji;
result = prime * result + ((xingbie == null) ? 0 : xingbie.hashCode());
result = prime * result + ((xingming == null) ? 0 : xingming.hashCode());
return result;
}
public boolean equals(Object obj) {
if (this == obj)
return true;
if (obj == null)
return false;
if (getClass() != obj.getClass())
return false;
zhigong other = (zhigong) obj;
if (bianhao != other.bianhao)
return false;
if (getiyeji != other.getiyeji)
return false;
if (tuantiyeji != other.tuantiyeji)
return false;
if (xingbie == null) {
if (other.xingbie != null)
return false;
} else if (!xingbie.equals(other.xingbie))
return false;
if (xingming == null) {
if (other.xingming != null)
return false;
} else if (!xingming.equals(other.xingming))
return false;
return true;
}
public int getBianhao() {
return bianhao;
}
public void setBianhao(int bianhao) {
this.bianhao = bianhao;
}
public int getTuantiyeji() {
return tuantiyeji;
}
public void setTuantiyeji(int tuantiyeji) {
this.tuantiyeji = tuantiyeji;
}
public int getGetiyeji() {
return getiyeji;
}
public void setGetiyeji(int getiyeji) {
this.getiyeji = getiyeji;
}
public String getXingbie() {
return xingbie;
}
public void setXingbie(String xingbie) {
this.xingbie = xingbie;
}
public String getXingming() {
return xingming;
}
public void setXingming(String xingming) {
this.xingming = xingming;
}
public int compareTo(zhigong zhi) {
int i=(this.getGetiyeji()+this.getTuantiyeji())-(zhi.getGetiyeji()+zhi.getTuantiyeji());
if(i>0) {
i=1;
}else if(i<0) {
i=-1;
}else {
i=0;
}
return i;
}
}
数组元素的删除
import java.util.*;
import java.util.LinkedList;
public class Main{
public static void main(String[] args){
Scanner s = new Scanner(System.in);
LinkedList<Integer> list = new LinkedList<Integer>();
int n = s.nextInt();
for(int i = 0; i<n; i++){
list.add(s.nextInt());
}
int k = s.nextInt();
for(int i = 0; i<k; i++){
int index = s.nextInt();
list.remove(index-1);
}
s.close();
for(int i = 0; i<list.size(); i++){
System.out.print(list.get(i));
if(i<list.size()-1){
System.out.print(" ");
}
}
}
}
使用二维数组实现Matrix(矩阵)。
import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int x1,y1,x2,y2;
x1=sc.nextInt();
y1=sc.nextInt();
int[][] Matrix1=new int[x1][y1];
for(int i=0;i<x1;i++){
for(int j=0;j<y1;j++){
Matrix1[i][j]=sc.nextInt();
}
}
x2=sc.nextInt();
y2=sc.nextInt();
int[][] Matrix2=new int[x2][y2];
for(int i=0;i<x2;i++){
for(int j=0;j<y2;j++){
Matrix2[i][j]=sc.nextInt();
}
}
int[][] Matrix3=new int[x1][y2];
for(int i=0;i<x1;i++){
for(int j=0;j<y2;j++){
for(int n=0;n<y1;n++){
Matrix3[i][j]+=Matrix1[i][n]*Matrix2[n][j];
}
}
}
for(int i=0;i<x1;i++){
for(int j=0;j<y2;j++){
System.out.print(Matrix3[i][j]+" ");
}
System.out.println();
}
}
}
数组乱炖
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n= sc.nextInt();
if (n>0){
int[] a=new int[n];
int[] b=new int[n];
for (int i = 0; i < n; i++) {
a[i]= sc.nextInt();
}
System.out.println(Arrays.toString(a));
System.arraycopy(a, 0, b, 0, a.length);
System.out.println(Arrays.toString(b));
Arrays.sort(a);
System.out.println(Arrays.toString(a));
int m= Arrays.binarySearch(a,sc.nextInt());
if(m>-1) System.out.println(m);
else System.out.println("no");
if (n>=2){
a[0]=9;
a[1]=9;
}
System.out.println(Arrays.toString(a));
if (Arrays.equals(a,b)) System.out.println("yes");
else System.out.println("no");
}
}
}
求矩阵主对角线元素的和
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
double sum =0 ;
double array[][] = new double[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
array[i][j] = sc.nextDouble();
if (i==j){
sum += array[i][j];
}
}
}
System.out.println(sum);
}
}
单词替换
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
String x = sc.nextLine();
String a = sc.nextLine();
String b = sc.nextLine();
String[] xa = x.split(" ");
List<String> list = Arrays.asList(xa);
Collections.replaceAll(list,a,b);
System.out.print(list.get(0));
for(int i = 1; i<list.size(); i++){
System.out.print(" " + list.get(i));
}
}
}
判断登录信息--Java字符串比较
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
String name = sc.next();
String key = sc.next();
String str1 = "SwpuIot";
String str2 = "123456";
sc.close();
if(str1.equals(name)){
if(str2.equals(key))
System.out.print("Welcome");
else
System.out.print("Mismatch");
}
else
System.out.print("NotExist");
}
}
图书价格汇总
import java.util.Scanner;
public class Main {
public static void main(String args[]) {
Scanner scan=new Scanner(System.in);
String str=scan.nextLine();
String stri[]=str.split("；");//以分号分割
//Main main=new Main();
int sum=0;
for(int i=0;i<stri.length;i++)
System.out.println(stri[i]);
for(int i=0;i<stri.length;i++) {
String stri1= (stri[i].split("："))[0];
Integer pr=Integer.parseInt((stri[i].split("："))[1].trim());
sum+=pr;
}
System.out.println("总价格为"+sum);
}
}
02基本语法-02-StringBuilder
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
while(scan.hasNext()) {
int n = scan.nextInt();
int begin = scan.nextInt();
int end = scan.nextInt();
StringBuilder string = new StringBuilder();
for (int i = 0; i < n; i++) {
string.append(i);
}
System.out.println(string.substring(begin,end));
}
scan.close();
}
}
通过键盘输入一行字符，分别统计出其中英文字母、空格、数字和其它字符的个数
import java.util.Scanner;
public class Main {
public static void main(String[] args){
int upCaseCnt=0;
int lowCaseCnt=0;
int spaceCnt=0;
int numCnt=0;
int otherCnt=0;
int caseCnt=0;
Scanner scan = new Scanner(System.in);
String str = scan.nextLine();
char[] ch = str.toCharArray();
for(int i=0;i<ch.length;i++){
if(Character.isUpperCase(ch[i])){
upCaseCnt++;
}else if(Character.isLowerCase(ch[i])) {
lowCaseCnt++;
}else if(Character.isDigit(ch[i])){
numCnt++;
}else if(Character.isSpaceChar(ch[i])){
spaceCnt++;
}else{
otherCnt++;
}
}
caseCnt = upCaseCnt + lowCaseCnt;
System.out.println("字母个数："+caseCnt);
System.out.println("数字个数："+numCnt);
System.out.println("空格个数："+spaceCnt);
System.out.println("其他字符个数："+otherCnt);
}
}
String的格式判断与内容提取
import java.util.*;
public class Main {
public static void main(String args[]) {
Scanner scan=new Scanner(System.in);
String str=scan.nextLine();
int n=str.length()/8;
int judge=0;
if(str.length()%8==0)
{
String s[][]=new String[n][8];
for(int i=0;i<n;i++)
{
for(int j=0;j<8;j++)
{
char a=str.charAt(i*8+j);
String str2=String.valueOf(a);
s[i][j]=str2;
}
if("2".equals(s[i][0])&&"0".equals(s[i][1])&&"2".equals(s[i][2])&&"0".equals(s[i][3])&&"1".equals(s[i][4])&&"7".equals(s[i][5]))
{
for(int k=4;k<8;k++)
{
if(k==4)
{
if(judge==0)
{
judge++;
}
else
{
System.out.print(" ");
}
}
System.out.print(s[i][k]);
}
}
if("2".equals(s[i][0])&&"0".equals(s[i][1])&&"2".equals(s[i][2])&&"0".equals(s[i][3])&&"6".equals(s[i][4])&&"1".equals(s[i][5]))
{
for(int k=4;k<8;k++)
{
if(k==4)
{
if(judge==0)
{
judge++;
}
else
{
System.out.print(" ");
}
}
System.out.print(s[i][k]);
}
}
}
}
else
{
System.out.println("Wrong Format");
}
}
}
字符替换
import java.util.*;
class Main{
public static void main(String[] args){
Scanner scan = new Scanner(System.in);
String str = scan.nextLine();
char stri[]=str.toCharArray();
for(int i=0;i<str.length();i++)
{
if(65<=stri[i]&&stri[i]<=90)
{
stri[i]=(char)(155-stri[i]);
}
System.out.print(stri[i]);
}
}
}
统计字符在字符串中第n次出现的位置
import java.util.*;
class Main{
public static void main(String[] args){
Scanner scan = new Scanner (System.in);
String str = scan.nextLine();
int x;
x = scan.nextInt();
char s = scan.next().charAt(0);
char stri[] = str.toCharArray();
int f=0;
for(int i=0;i<str.length();++i)
{
if(stri[i]==s)
f++;
if(f==x)
{
System.out.println(i+1);
break;
}
else if(i==(str.length()-1)&&f!=x)
{
System.out.println("no");
break;
}
}
}
}
倒置字符串并输出
import java.util.*;
class Main{
public static void main(String[] args){
Scanner scan = new Scanner(System.in);
String str = scan.nextLine();
char s[] = str.toCharArray();
for(int i=(str.length()-1);i>=0;i--)
{
System.out.print(s[i]);
}
System.out.print("\n");
System.out.print(s[str.length()-1]);
}
}
定义商品类，封装成员变量，输出对象
import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
shangpin s=new shangpin();
String number;
String name;
double price;
number=sc.next();
name=sc.next();
price=sc.nextDouble();
s.setNumber(number);
s.setName(name);
s.setPrice(price);
s.showInfo();
}
}
class shangpin{
private String number;
private String name;
private double price;
public shangpin(){}
public void setNumber(String number){
this.number=number;
}
public String getNumber(){
return number;
}
public void setName(String name){
this.name=name;
}
public String getName(){
return name;
}
public void setPrice(double price){
this.price=price;
}
public double getPrice(){
return price;
}
public void showInfo(){
System.out.println(this.number+","+this.name+","+this.price);
}
}
字符串反转
import java.util.*;
class Demo1{
private static String str;
public Demo1(String s)
{
str = testDemo(s);
}
private static String testDemo(String s)
{
int length = s.length();
String reverse = "";
for(int i = 0;i < length;i++)
{
reverse = s.charAt(i) + reverse;
}
return reverse;
}
public String toString() {
return str;
}
}
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String ss = sc.next();
Demo1 d = new Demo1(ss);
System.out.println(d.toString());
}
}
jmu-Java-03面向对象基础-04-形状-继承
import java.util.*;
public class Main {
public static double sumAllArea(double areaall)
{
return areaall;
}
public static double sumAllPerimeter(double perimeterall)
{
return perimeterall;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
sc.nextLine();
Shape []xz = new Shape[n];
double sumAllArea = 0, sumAllPerimeter = 0;
for(int i = 0;i < n;i++)
{
String ss = sc.nextLine();
if(ss.equals("rect"))
{
int a = sc.nextInt(),b = sc.nextInt();
sc.nextLine();
xz[i] = new Rectangle(a,b);
}
if(ss.equals("cir"))
{
int r = sc.nextInt();
sc.nextLine();
xz[i] = new Circle(r);
}
sumAllArea += xz[i].getArea();
sumAllPerimeter += xz[i].getPerimeter();
}
System.out.println(sumAllPerimeter(sumAllPerimeter));
System.out.println(sumAllArea(sumAllArea));
System.out.print("[");
for(int i = 0;i < n;i++)
{
if(i != 0)
System.out.print(", ");
System.out.print(xz[i].toString());
}
System.out.println("]");
for(int i = 0;i < n;i++)
{
System.out.println(xz[i].getClass()+","+xz[i].getClass().getSuperclass());
}
sc.close();
}
}
abstract class Shape {
final double PI = 3.14;
public abstract double getPerimeter();
public abstract double getArea();
}
class Rectangle extends Shape {
public int width;
public int length;
public Rectangle(int width, int length) {
super();
this.width = width;
this.length = length;
}
public String toString() {
return "Rectangle [width=" + width + ", length=" + length + "]";
}
public double getPerimeter() {
return 2*(width+length);
}
public double getArea() {
return width*length;
}
}
class Circle extends Shape {
public int radius;
public Circle(int radius) {
super();
this.radius = radius;
}
public String toString() {
return "Circle [radius=" + radius + "]";
}
public double getPerimeter() {
return 2*PI*radius;
}
public double getArea() {
return PI*radius*radius;
}
}
jmu-Java-04面向对象进阶-03-接口-自定义接口ArrayIntegerStack
import java.util.Arrays;
import java.util.Scanner;
interface IntegerStack {
public Integer push(Integer item);
public Integer pop();
public Integer peek();
public boolean empty();
public int size();
}
class ArrayIntegerStack implements IntegerStack{
private Integer[] arr;
private int top = 0;
public ArrayIntegerStack(int n){
arr = new Integer[n];
Arrays.fill(arr, null);
}
public ArrayIntegerStack(){}
public String toString() {
return Arrays.toString(arr);
}
public Integer push(Integer item) {
if (item == null || arr.length == top){
return null;
}
arr[top++] = item;
return item;
}
public Integer pop() {
if (top == 0){
return null;
}
return arr[--top];
}
public Integer peek() {
if (top == 0){
return null;
}
return arr[top - 1];
}
public boolean empty() {
return top == 0;
}
public int size() {
return top;
}
}
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
ArrayIntegerStack ais = new ArrayIntegerStack(n);
int m = scanner.nextInt();
while(m-- > 0){
int item = scanner.nextInt();
System.out.println(ais.push(item));
}
System.out.println(ais.peek() + "," + ais.empty() + "," + ais.size());
System.out.println(ais);
int x = scanner.nextInt();
while(x-- > 0){
System.out.println(ais.pop());
}
System.out.println(ais.peek() + "," + ais.empty() + "," + ais.size());
System.out.println(ais);
}
}
jmu-Java-02基本语法-03-身份证排序
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc=new Scanner (System.in);
int n;
n=sc.nextInt();
String s[]=new String[n];
String birth[]=new String[n];
String str;
for(int i=0;i<n;i++) {
s[i]=sc.next();
}
while(true) {
str=sc.next();
if(str.equals("e")) {
System.out.println("exit");
break;
}else if(str.equals("sort1")) {
for(int i=0;i<n;i++) {
birth[i]=s[i].substring(6,10 )+'-'+ s[i].substring(10, 12)+'-'+s[i].substring(12, 14);
}
Arrays.sort(birth);
for(int i=0;i<n;i++) {
System.out.println(birth[i]);
}
}else if(str.equals("sort2")) {
for(int i=0;i<n;i++) {
birth[i]=s[i].substring(6,10 )+ s[i].substring(10, 12)+s[i].substring(12, 14);
}
Arrays.sort(birth);
for(int i=0;i<n;i++) {
for(int j=0;j<n;j++){
if(s[j].contains(birth[i])) {
System.out.println(s[j]);
break;
}
}
}
}
}
}
}
jmu-Java&Python-统计文字中的单词数量并按出现次数排序
import java.util.*;
import java.util.Map.Entry;
public class Main {
public static void main(String[] args) {
Scanner scan=new Scanner(System.in);
Map<String,Integer> mp=new TreeMap<String,Integer>();
String s=null;
int count=0;
while(!(s=scan.next()).equals("!!!!!")) {
s=s.replace("!", "");
s=s.replace(".", "");
s=s.replace(",", "");
s=s.replace(":", "");
s=s.replace("*", "");
s=s.replace("?", "");
s=s.toLowerCase();
if(!mp.containsKey(s)) {
mp.put(s, 1);
count++;
}
else {
mp.put(s, mp.get(s)+1);
}
}
scan.close();
System.out.println(count);
List<Map.Entry<String, Integer>> list=new LinkedList<Map.Entry<String,Integer>>(mp.entrySet());
Collections.sort(list,new sortByValue());
Map<String,Integer>mmp=new LinkedHashMap<String,Integer>();
for(Map.Entry<String, Integer> entr:list) {
mmp.put(entr.getKey(), entr.getValue());
}
int cnt=0;
for(Map.Entry<String, Integer> entr:mmp.entrySet()) {
if(cnt++>9) {
break;
}
System.out.println(entr.getKey()+"="+entr.getValue());
}
}
}
class sortByValue implements Comparator<Map.Entry<String,Integer>>{
public int compare(Entry<String, Integer> o1, Entry<String, Integer> o2) {
if(o1.getValue().compareTo(o2.getValue())<0)return 1;
else if(o1.getValue().compareTo(o2.getValue())>0)return -1;
else {
return o1.getKey().compareTo(o2.getKey());
}
}
}
求分数序列前N项和
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.text.DecimalFormat;
import java.util.Scanner;
public class Main {
private static Scanner cin = new Scanner(System.in);
private static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out), true);
public static void main(String[] args) {
int n = cin.nextInt();
double up = 2, down = 1;
double ans = 0D;
for (int i = 0; i < n; ++i) {
ans += up / down;
double toUp = up;
up += down;
down = toUp;
}
DecimalFormat df = new DecimalFormat("0.00");
out.println(df.format(ans));
}
}
找最长的字符串
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.*;
/**
* @author Fancyking
*/
public class Main {
private static Scanner cin = new Scanner(System.in);
private static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out), true);
private static Set<String> dic = new TreeSet<>(new Comparator<String>() {
@Override
public int compare(String o1, String o2) {
return - o1.length() + o2.length();
}
});
public static void main(String[] args) {
int n = cin.nextInt();
cin.nextLine();
for (int i = 0; i < n; ++i) {
dic.add(cin.nextLine());
}
Iterator<String> p = dic.iterator();
out.println("The longest is: " + p.next());
}
}
jmu-Java-03面向对象基础-01-构造函数与toString
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
/**
* @author Fancyking
*/
public class Main {
private static Scanner cin = new Scanner(System.in);
private static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out), true);
public static void main(String[] args) {
int n = cin.nextInt();
List<Person> dic = new ArrayList<>(n);
String name;
int age;
boolean gender;
for (int i = 0; i < n; ++i) {
name = cin.next();
age = cin.nextInt();
gender = cin.nextBoolean();
dic.add(new Person(name, age, gender));
}
for (int i = dic.size() - 1; i >= 0; --i) {
out.println(dic.get(i).toString());
}
Person emptyPerson = new Person();
out.println(emptyPerson.toString());
}
}
class Person {
private static Scanner cin = new Scanner(System.in);
private static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out), true);
private String name;
private int age;
private boolean gender;
private int id;
Person() {
out.println("This is constructor");
out.println(this.name + "," + this.age + "," + this.gender + "," + this.id);
}
Person(String name, int age, boolean gender) {
this.name = name;
this.age = age;
this.gender = gender;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public int getAge() {
return age;
}
public void setAge(int age) {
this.age = age;
}
public boolean isGender() {
return gender;
}
public void setGender(boolean gender) {
this.gender = gender;
}
public int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
@Override
public String toString() {
return "Person [name=" + this.name + ", age=" + this.age + ", gender=" + this.gender + ", id=" + this.id + "]";
}
}
jmu-Java-03面向对象基础-02-构造函数与初始化块
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
/**
* @author Fancyking
*/
public class Main {
private static Scanner cin = new Scanner(System.in);
private static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out), true);
private static List<Person> dic = new ArrayList<>(16);
public static void main(String[] args) {
int n = cin.nextInt();
for (int i = 0; i < n; ++i) {
dic.add(new Person(cin.next(), cin.nextInt(), cin.nextBoolean()));
}
for (int i = dic.size() - 1; i >= 0; --i) {
out.println(dic.get(i).toString());
}
Person emptyPerson = new Person();
out.println(emptyPerson);
}
}
class Person {
private static int cntID = 0;
private static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out), true);
static {
out.println("This is static initialization block");
}
private String name;
private boolean gender;
private int age;
private int id;
Person() {
this.id = cntID++;
out.println("This is initialization block, id is " + this.id);
out.println("This is constructor");
out.println(this.name + "," + this.age + "," + this.gender + "," + this.id);
}
Person(String name, int age, boolean gender) {
this.name = name;
this.gender = gender;
this.age = age;
this.id = cntID++;
out.println("This is initialization block, id is " + this.id);
}
@Override
public String toString() {
return "Person [" +
"name=" + name +
", age=" + age +
", gender=" + gender +
", id=" + id +
']';
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public boolean isGender() {
return gender;
}
public void setGender(boolean gender) {
this.gender = gender;
}
public int getAge() {
return age;
}
public void setAge(int age) {
this.age = age;
}
public int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
}
jmu-Java&Python-统计一段文字中的单词个数并按单词的字母顺序排序后输出
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.*;
/**
* @author Fancyking
*/
public class Main {
final private static String END = "!!!!!";
private static Scanner cin = new Scanner(System.in);
private static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out), true);
private static Map<String, Integer> dcDic = new HashMap<>(16);
public static void main(String[] args) {
readInData();
List<Map.Entry<String, Integer>> toListMap = sortDcDic();
topPrint(toListMap);
}
private static void topPrint(List<Map.Entry<String, Integer>> toListMap) {
int cnt = 0;
out.println(toListMap.size());
for (Map.Entry<String, Integer> now : toListMap) {
out.println(now.getKey());
if (++cnt == 10) {
break;
}
}
}
private static void readInData() {
String input;
while (cin.hasNextLine()) {
input = cin.nextLine();
input = input.trim();
if (END.equals(input)) {
break;
}
if ("".equals(input)) {
continue;
}
String[] dcStringArray = splitToString(input);
addToDcDic(dcStringArray);
}
}
private static List<Map.Entry<String, Integer>> sortDcDic() {
List<Map.Entry<String, Integer>> toListMap = new ArrayList<>(dcDic.entrySet());
toListMap.sort(Comparator.comparing(Map.Entry::getKey));
return toListMap;
}
private static void addToDcDic(String[] dcStringArray) {
for (String now : dcStringArray) {
if (dcDic.containsKey(now)) {
dcDic.put(now, dcDic.get(now) + 1);
} else {
dcDic.put(now, 1);
}
}
}
private static String[] splitToString(String input) {
input = input.replaceAll("[?!.,:*]", "");
return input.split("\\s+");
}
}
构造方法
请补充以下代码，完成输出要求。（注意：需要提交完整代码）
public class Main {
public static void main(String[] args) {
new RR(true);
}
}
class RR {
public RR() {
System.out.print("8");
}
public RR(int x) {
this();
System.out.print(".");
}
public RR(boolean b) {
this(1);
System.out.print("00");
}
}
求一组数组中的平均数
import java.math.BigDecimal;
import java.text.DecimalFormat;
import java.util.Scanner;
/**
* 输入10个整数，输出这10个整数的的平均数，要求输出的平均数保留2位小数
*
* @author Fancyking
*/
public class Main {
private static Scanner cin = new Scanner(System.in);
public static void main(String[] args) {
int maxFor = 10;
BigDecimal ans = BigDecimal.valueOf(0);
for (int i = 0; i < maxFor; ++i) {
ans = ans.add(cin.nextBigDecimal());
}
DecimalFormat df = new DecimalFormat("0.00");
ans = ans.divide(new BigDecimal(maxFor));
String dans = df.format(ans);
System.out.println(dans);
}
}
JAVA-求整数序列中出现次数最多的数
import java.io.*;
import java.util.*;
/**
* 要求统计一个整型序列中出现次数最多的整数及其出现次数。
*
* @author Fancyking
*/
public class Main {
private static StreamTokenizer cin = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
private static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out), true);
private static Map<Integer, Integer> dic = new HashMap<>(16);
public static void main(String[] args) throws IOException {
cin.nextToken();
int now;
int n = (int) cin.nval;
for (int i = 0; i < n; ++i) {
cin.nextToken();
now = (int) cin.nval;
if (dic.containsKey(now)) {
dic.put(now, dic.get(now) + 1);
} else {
dic.put(now, 1);
}
}
List<Map.Entry<Integer, Integer>> reDic = new ArrayList<>(dic.entrySet());
reDic.sort((o1, o2) -> o2.getValue().compareTo(o1.getValue()));
Iterator<Map.Entry<Integer, Integer>> itp = reDic.iterator();
Map.Entry<Integer, Integer> outAns = itp.next();
out.println(outAns.getKey() + " " + outAns.getValue());
}
}
统计正数和负数的个数然后计算这些数的平均值
import java.io.*;
import java.text.DecimalFormat;
/**
* 知道BUG在哪里了，应该是输入0，什么都不输出，改了这个地方，第二个样例就过了
*
* @author Fancyking
*/
public class Main {
private static StreamTokenizer cin = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
private static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out), true);
public static void main(String[] args) throws IOException {
double ans = 0D;
int inputNum, zCount = 0, fCount = 0;
while (cin.nextToken() != StreamTokenizer.TT_EOF) {
inputNum = (int) cin.nval;
if (inputNum == 0) {
break;
}
if (inputNum > 0) {
zCount++;
} else {
fCount++;
}
ans += (double) inputNum;
}
if (zCount + fCount != 0) {
out.println(zCount);
out.println(fCount);
out.println(new DecimalFormat("0").format(ans));
out.println(ans / (zCount + fCount));
}
}
}
数组元素的删除
import java.io.BufferedInputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.Scanner;
/**
* @author Fancyking
*/
public class Main {
private static Scanner cin = new Scanner(new BufferedInputStream(System.in));
private static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out), true);
private static ArrayList<Integer> dic = new ArrayList<>(16);
public static void main(String[] args) {
int n = cin.nextInt();
for (int i = 0; i < n; ++i) {
dic.add(cin.nextInt());
}
int k = cin.nextInt();
for (int i = 0; i < k; ++i) {
int removeID = cin.nextInt();
remove(removeID);
}
for (int i = 0; i < dic.size(); ++i) {
if (i != 0) {
out.print(" ");
}
out.print(dic.get(i));
}
out.println();
}
private static void remove(int removeID) {
Iterator<Integer> p = dic.iterator();
int cnt = 0;
while (cnt < removeID && p.hasNext()) {
p.next();
cnt++;
}
if (cnt == removeID) {
p.remove();
}
}
}
7-5 成绩录入时的及格与不及格人数统计
import java.io.*;
/**
* @author Fancyking
*/
public class Main {
private static StreamTokenizer cin = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
private static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out), true);
public static void main(String[] args) throws IOException, CheckMarkException {
cin.nextToken();
int numOfStudents = (int) cin.nval;
int goodStu = 0, badStu = 0, nowCheck;
for (int i = 0; i < numOfStudents; ++i) {
cin.nextToken();
nowCheck = (int) cin.nval;
if (nowCheck > 59 && nowCheck < 101) {
goodStu += 1;
} else if (nowCheck > -1 && nowCheck < 60) {
badStu += 1;
}
try {
if (nowCheck < 0 || nowCheck > 100) {
i -= 1;
throw new CheckMarkException(nowCheck);
}
} catch (CheckMarkException o) {
o.printStackTrace(o.toString());
}
}
out.println(goodStu);
out.println(badStu);
}
}
class CheckMarkException extends Exception {
private int errorNum;
public CheckMarkException() {
super();
}
CheckMarkException(int nowCheck) {
this.errorNum = nowCheck;
}
public int getErrorNum() {
return errorNum;
}
public void setErrorNum(int errorNum) {
this.errorNum = errorNum;
}
@Override
public String toString() {
return String.valueOf(errorNum) + "invalid!";
}
void printStackTrace(String toString) {
System.out.println(toString);
}
}
7-6 jmu-Java-02基本语法-02-StringBuilder
import java.io.*;
/**
* @author Fancyking
*/
public class Main {
private static StreamTokenizer cin = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
private static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out), true);
public static void main(String[] args) throws IOException {
while (cin.nextToken() != StreamTokenizer.TT_EOF) {
int n = (int) cin.nval;
cin.nextToken();
int bg = (int) cin.nval;
cin.nextToken();
int ed = (int) cin.nval;
StringBuilder ans = new StringBuilder("");
for (int i = 0; i < n; ++i) {
ans.append(i);
}
out.println(ans.subSequence(bg, ed));
}
}
}
求矩阵主对角线元素的和
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Scanner;
/**
* @author Fancyking
*/
public class Main {
private static Scanner cin = new Scanner(System.in);
private static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out), true);
public static void main(String[] args) {
int n = cin.nextInt();
int cnt = 0;
double sum = 0D;
for (int i = 0; i < n * n; ++i) {
double now = cin.nextDouble();
if (i == cnt) {
cnt += n + 1;
sum += now;
}
}
out.println(sum);
}
}
整理队伍
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Scanner;
/**
* @author Fancyking
*/
public class Main {
private static Scanner cin = new Scanner(System.in);
private static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out), true);
public static void main(String[] args) {
int n = cin.nextInt();
int[] dic = new int[n + 1];
for (int i = 0; i < n; ++i) {
dic[i] = cin.nextInt();
}
int m = cin.nextInt();
int swapA, swapB;
for (int i = 0; i < m; ++i) {
swapA = cin.nextInt();
swapB = cin.nextInt();
int tempSwap = dic[swapB - 1];
dic[swapB - 1] = dic[swapA - 1];
dic[swapA - 1] = tempSwap;
}
for (int i = 0; i < n; ++i) {
if (i != 0) {
out.print(" ");
}
out.print(dic[i]);
}
out.println();
}
}
7-9 超市贴花
import java.util.*;
public class Main {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int n= sc.nextInt(),count=0;
TreeMap<Integer,Integer> tm=new TreeMap<>();
for (int i = 0; i < n; i++) {
int a= sc.nextInt();
if (tm.get(a)!=null)tm.put(a,tm.get(a)+1);
else tm.put(a,1);
}
Set<Integer> set = tm.keySet();
int index=0,temp=0,first=0,last=0;
//index用来标记每次读取三个的记录
for (Integer integer : set) {
if (index==0)first=integer;//first用来记录前一个数据
else if (index==2)last=integer;//last记录最后一个数据
else temp=integer;
if (temp-first==1&&last-temp==1){
int min=Math.min(tm.get(temp),tm.get(first));
min=Math.min(min,tm.get(last));
count+=min;//min用来记录最小值，即最多能换几次
}
index++;
if (index>2)index=0;
}
System.out.println(count);
}
}
解析二维数组
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
String str = cin.next();
int i=0,j=0;
int len = str.length();
String _str = "";
for(int k=0;k<len;k++) {
if(str.charAt(k)==',') {
System.out.print("d["+i+","+j+"] = "+_str+" ");
j++;
_str = "";
}
else if(str.charAt(k)==';') {
System.out.println("d["+i+","+j+"] = "+_str);
j = 0;
i ++;
_str = "";
}
else if(k == str.length()-1) {
_str = _str + str.charAt(k);
System.out.println("d["+i+","+j+"] = "+_str);
}
else {
_str = _str + str.charAt(k);
}
}
}
}
我也会加密
import java.util.Scanner;
public class Main{
public static void main(String []args)
{
Scanner cin=new Scanner(System.in);
String s=cin.nextLine();
int mm=s.length()%5+1;
int j=0;
int length;
if(s.length()%mm==0)
length=s.length()/mm;
else
length=s.length()/mm+1;
char []ns=new char[length];
for(int i=0;i<length;i++)
{
if(j<=s.length())
ns[i]=s.charAt(j);
else break;
j+=mm;
}
for(int i=0;i<ns.length/2;i++)
{
char t=ns[i];
ns[i]=ns[ns.length-i-1];
ns[ns.length-i-1]=t;
}
System.out.println(ns);
cin.close();
}
}
MyDate类
import java.util.Scanner;
public class Main{
public static void main(String []args){
Scanner in = new Scanner(System.in);
MyDate now = new MyDate(in.nextInt(),in.nextInt(),in.nextInt());
MyDate d = new MyDate(in.nextInt(),in.nextInt(),in.nextInt());
System.out.println(now.month+"/"+now.day+"/"+now.year+" "+now.compare(d));
}
}
class MyDate{
public int day;
public int month;
public int year;
public MyDate(int _year,int _month ,int _day){
day = _day ;month = _month; year = _year;
}
int compare(MyDate d) {
if(this.year > d.year)
return 1;
else if(this.year == d.year && this.month > d.month )
return 1;
else if(this.year == d.year && this.month == d.month && this.day > d.day)
return 1;
else if(this.year == d.year && this.month == d.month && this.day == d.day)
return 0;
return -1;
}
}
打球过程
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int num = scan.nextInt();
String point = scan.next();
if(num == 1)
{
BallMatch ball = new FootballMatch(point);
ball.checkin();
ball.start();
ball.play();
ball.end();
ball.annouceResult(point);
}
else
{
BallMatch ball = new BasketBallMatch(point);
ball.checkin();
ball.start();
ball.play();
ball.end();
ball.annouceResult(point);
}
}
}
abstract class BallMatch{
private String points;
public BallMatch(String points)
{
this.points = points;
}
public String getPoints()
{
return points;
}
public void checkin()
{
System.out.println("now checking in");
}
public void start()
{
System.out.println("now starting");
}
abstract public void play();
public void end()
{
System.out.println("now ending");
}
abstract public void annouceResult(String points);
}
class FootballMatch extends BallMatch{
public FootballMatch(String points)
{
super(points);
}
public void play()
{
System.out.println("now playing football");
}
public void annouceResult(String points)
{
System.out.println("now annoucing result: "+super.getPoints());
}
}
class BasketBallMatch extends BallMatch{
public BasketBallMatch(String points)
{
super(points);
}
public void play()
{
System.out.println("now playing basketball");
}
public void annouceResult(String points)
{
System.out.println("now annoucing result: "+super.getPoints());
}
}
数据类型判断import java.util.Scanner;
public class Main {
public static void main(String []args)
{
Scanner cin=new Scanner(System.in);
String s;
int j=0;
while(cin.hasNext()){
if(j!=0)
System.out.print(" ");
if(cin.hasNextInt()){
System.out.print("int");
}
else if(cin.hasNextDouble()){
System.out.print("double");
}
else if(cin.hasNextBoolean()){
System.out.print("boolean");
}
else System.out.print("String");
cin.next();
j=1;
}
}
}
学生成绩读取与排序
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
/**
* @author Fancyking
*/
public class Main {
private static List<Student> dic = new ArrayList<>(16);
private static Scanner cin = new Scanner(System.in);
private static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out), true);
public static void main(String[] args) {
final String exit = "exit";
String name, className;
int stuID, mark;
while (cin.hasNext()) {
String line = cin.nextLine();
String[] lins = line.split(",");
if (lins.length == 1 && lins[0].equals(exit)) {
break;
} else {
name = lins[0];
stuID = Integer.valueOf(lins[1]);
className = lins[2];
mark = Integer.valueOf(lins[3]);
boolean ok = false;
for (Student student : dic) {
if (student.getStuID() == stuID) {
student.setMark(mark);
ok = true;
}
}
if (!ok) {
dic.add(new Student(name, stuID, className, mark));
}
}
}
dic.sort((o1, o2) -> {
if (o1.getMark() == o2.getMark()) {
return o1.getStuID() - o2.getStuID();
} else {
return o2.getMark() - o1.getMark();
}
});
int rank = 1;
for (Student now : dic) {
out.println("No" + rank++ + ":" + now.toString());
}
}
}
class Student {
private String name;
private int stuID;
private String className;
private int mark;
Student(String name, int stuID, String className, int mark) {
this.name = name;
this.stuID = stuID;
this.className = className;
this.mark = mark;
}
int getMark() {
return this.mark;
}
void setMark(int mark) {
this.mark += mark;
}
int getStuID() {
return this.stuID;
}
@Override
public boolean equals(Object o) {
if (o instanceof Student) {
Student so = (Student) o;
return so.stuID == this.stuID;
} else {
return false;
}
}
@Override
public String toString() {
return this.stuID + "," + this.name;
}
public String getClassName() {
return className;
}
public void setClassName(String className) {
this.className = className;
}
}
数组元素交换
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Scanner;
/**
* @author Fancyking
*/
public class Main {
private static Scanner cin = new Scanner(System.in);
private static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out), true);
public static void main(String[] args) {
int big = -0x3f3f3f3f, small = 0x3f3f3f3f;
int bigPos = 0, smallPos = 0;
String in = cin.nextLine();
String[] inToSplit = in.split("\\s+");
int[] inToDouble = new int[inToSplit.length];
int i = 0;
for (String now : inToSplit) {
int judge = Integer.valueOf(now);
if (judge > big) {
big = judge;
bigPos = i;
}
if (judge < small) {
small = judge;
smallPos = i;
}
inToDouble[i++] = judge;
out.println(now);
}
inToDouble[bigPos] = inToDouble[0];
inToDouble[0] = big;
inToDouble[smallPos] = inToDouble[inToDouble.length - 1];
inToDouble[inToDouble.length - 1] = small;
for (int i1 : inToDouble) {
out.println(i1);
}
}
}
学生类-构造函数
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Scanner;
public class Main {
private static Scanner cin = new Scanner(System.in);
private static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out), true);
public static void main(String[] args) {
String name = cin.next();
int age = cin.nextInt();
String sex = cin.next();
Student stu = new Student(name, sex, age);
out.println(stu.toString());
out.close();
}
}
class Student {
private String name;
private String sex;
private int age;
Student(String name, String sex, int age) {
this.name = name;
this.sex = sex;
this.age = age;
}
@Override
public String toString() {
return "Student [name='" + this.name + "', sex='" + this.sex + "', age=" + this.age + "]";
}
}
各类字符数
import java.util.Scanner;
public class Main {
public static void main(String []args)
{
Scanner cin=new Scanner(System.in);
String s=cin.nextLine();
char[]ns =s.toCharArray();
int upcount=0;
int lowcount=0;
int count=0;
for(int i=0;i<ns.length;i++)
{
if(ns[i]>=65&&ns[i]<=90)
upcount++;
else if(ns[i]>=97&&ns[i]<=122)
{
lowcount++;
}
else count++;
}
System.out.println(upcount);
System.out.println(lowcount);
System.out.println(count);
cin.close();
}
}
比较日期
import java.util.*;
import java.text.SimpleDateFormat;
import java.text.ParseException;
public class Main{
public static void main(String []args) throws ParseException
{
Scanner cin=new Scanner(System.in);
String str1=cin.next();
String str2=cin.next();
SimpleDateFormat df=new SimpleDateFormat("MM,dd,yyyy");
Date d1=df.parse(str1);
Date d2=df.parse(str2);
char a;
if(d1.after(d2)) a='>';
else if(d1.before(d2)) a='<';
else a='=';
System.out.println(a);
int b= (int) ((d2.getTime() - d1.getTime()) / (1000 * 60 * 60 * 24));//毫秒转化为天数
System.out.println(Math.abs(b));
cin.close();
}
}
多数组排序
import java.util.*;
public class Main{
public static void main(String []args) {
Scanner sc=new Scanner(System.in);
int a[]=new int [1000];
int f=0;
for(int i=0;i<3;i++) {
int n=sc.nextInt();
for(int j=0;j<n;j++) {
int m=sc.nextInt();
a[f]=m;
f++;
}
}
int flag;
for(int j=0;j<f;j++) {
for(int i=1;i<f-j;i++) {
if(a[i-1]<a[i]) {
flag=a[i];
a[i]=a[i-1];
a[i-1]=flag;
}
}
}
for(int i=0;i<f;i++) {
if(i==f-1) {
System.out.print(a[i]+"\n");
}
else
System.out.print(a[i]+" ");
}
}
}
两队PK
import java.lang.*;
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int num = 0;
int aNum = scan.nextInt();
Integer[] arraysA = new Integer[aNum];
for(int i = 0; i < aNum; ++i) {
arraysA[i] = scan.nextInt();
}
int bNum = scan.nextInt();
Integer[] arraysB = new Integer[bNum];
for(int i = 0; i < bNum; ++i) {
arraysB[i] = scan.nextInt();
}
Comparator<Integer> cmp = new MyComparator();
Arrays.sort(arraysA, cmp);
Arrays.sort(arraysB, cmp);
Integer[] res = new Integer[3];
int aCmp = 0, bCmp = 0;
for (int i = 0; i < 3; i++) {
if (arraysA[aCmp] > arraysB[bCmp]) {
res[i] = arraysA[aCmp++];
} else if (arraysA[aCmp] < arraysB[bCmp]) {
res[i] = arraysB[bCmp++];
} else {
i++;
}
}
for (int i = 0; i < res.length; ++i) {
System.out.print(res[i]);
if (i != res.length - 1)
System.out.print(" ");
}
System.out.println();
if (aCmp > bCmp) {
System.out.print("A");
} else {
System.out.print("B");
}
scan.close();
}
}
//不是extends Comparator
class MyComparator implements Comparator<Integer>{
@Override
public int compare(Integer o1, Integer o2) {
return o2.compareTo(o1);
}
}
公司季度销售额以及年销售额统计
import java.lang.*;
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int [][]sale = new int[4][3];
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 3; j++) {
sale[i][j] = scan.nextInt();
}
}
showTotal(sale);
scan.close();
}
public static void showTotal(int [][]sale) {
int totalYear = 0;
for (int i = 0; i < 4; ++i) {
int tmpTotal = 0;
for (int j = 0; j < 3; j++) {
tmpTotal += sale[i][j];
}
totalYear += tmpTotal;
System.out.println(i + 1 + "季度的销售额为：" + tmpTotal);
}
System.out.println("全年销售额为：" + totalYear);
}
}
数组元素的删除
import java.lang.*;
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int[] arr = new int[n];
int length = arr.length;
for (int i = 0; i < arr.length; ++i) {
arr[i] = scan.nextInt();
}
int deleteNum = scan.nextInt();
for (int i = 0; i < deleteNum; ++i) {
delete(arr, scan.nextInt() - 1, length--);
}
for (int i = 0 ; i < length; i++) {
System.out.print(arr[i]);
if (i != length - 1)
System.out.print(" ");
}
scan.close();
}
public static void delete(int[] arr, int add, int length) {
for (int i = add; i < length - 1; i++) {
arr[i] = arr[i + 1];
}
}
}
369寝室
import java.lang.*;
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int body1 = scan.nextInt();
int body2 = scan.nextInt();
int body3 = scan.nextInt();
if (!judge(body1, body2, body3)) {
System.out.println("so sad!");
}
scan.close();
}
public static boolean judge(int body1, int body2, int body3) {
for (int i = 1; i < 101; i++) {
body1++; body2++; body3++;
if (body1 % 10 == 3) {
if (body2 % 10 == 6) {
if (body3 % 10 == 9) {
System.out.println(i);
return true;
}
} else if (body2 % 10 == 9) {
if (body3 % 10 == 6) {
System.out.println(i);
return true;
}
}
} else if (body1 % 10 == 6) {
if (body2 % 10 == 3) {
if (body3 % 10 == 9) {
System.out.println(i);
return true;
}
} else if (body2 % 10 == 9) {
if (body3 % 10 == 3) {
System.out.println(i);
return true;
}
}
} else if (body1 % 10 == 9) {
if (body2 % 10 == 3) {
if (body3 % 10 == 6) {
System.out.println(i);
return true;
}
} else if (body2 % 10 == 6) {
if (body3 % 10 == 3) {
System.out.println(i);
return true;
}
}
}
}
return false;
}
}
N个数的排序与查
import java.io.*;
import java.util.*;
public class Main {
static final Scanner cin = new Scanner(new BufferedInputStream(System.in));
public static void main(String[] args) {
int n = cin.nextInt();
Vector<Integer> vec = new Vector<>();
for (int i = 0; i < n; ++i)
vec.add(cin.nextInt());
Collections.sort(vec);
boolean NotFind = true;
int num = cin.nextInt();
for (int i = 0; i < n; ++i)
if (vec.get(i) == num) {
System.out.print(i + 1);
NotFind = false;
}
if (NotFind) System.out.print(-1);
}
}
整数数组比较
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int num = scan.nextInt();
int BigNum = 0;
int EqualNum = 0;
int SmallNum = 0;
int ArrayA[] = new int[num];
int ArrayB[] = new int[num];
for(int i = 0;i < num; i++) {
ArrayA[i] = scan.nextInt();
// ArrayB[i] = ArrayA[i];
}
System.arraycopy(ArrayA, 0, ArrayB, 0, num);
Arrays.sort(ArrayB);
for(int i = 0; i < num;i++) {
if(ArrayA[i] > ArrayB[i]) {
BigNum ++;
}
else if(ArrayA[i] == ArrayB[i]) {
EqualNum ++;
}
else if(ArrayA[i] < ArrayB[i]) {
SmallNum ++;
}
}
System.out.println(BigNum);
System.out.println(EqualNum);
System.out.println(SmallNum);
}
}
购买第3便宜的商品
import java.util.Scanner;
import java.util.Arrays;
public class Main{
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
int n=in.nextInt();
if(n<3) {
System.out.println(-1);
System.exit(0);
}
int[] a=new int[n];
for(int i=0;i<n;i++) {
a[i]=in.nextInt();
}
Arrays.sort(a);
int j;
int flag=0;
int location=n;
for(int i=0;i<=n-1;i=j) {
j=i+1;
for(;j<n;j++) {
if(a[j]!=a[i]) {
flag++;
if(flag==2)location=j;
break;
}
}
}
if(location!=n)
System.out.println(a[location]);
else
System.out.println(-1);
}
}
集合求交
import java.util.Scanner;
import java.util.Arrays;
public class Main{
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
String[] str=new String[6];
for(int i=0;i<6;i++) {
str[i]=in.next();
}
int[] a1=new int[3];
int[] a2=new int[3];
for(int i=0;i<6;i++) {
if(i<=2)
a1[i]=Integer.parseInt(str[i]);
else
a2[i-3]=Integer.parseInt(str[i]);
}
for(int i=0;i<3;i++) {
for(int j=i+1;j<3;j++) {
if(a1[i]==a1[j])a1[i]=-1;
}
}
for(int i=0;i<3;i++) {
for(int j=i+1;j<3;j++) {
if(a2[i]==a2[j])a2[i]=-1;
}
}
int flag=0;
for(int i=0;i<3;i++) {
for(int j=0;j<3;j++) {
if(a1[i]!=-1 && a2[j]!=-1 && a1[i]==a2[j])flag++;
}
}
System.out.println(flag);
}
}
矩阵类
import java.util.Scanner;
import java.util.Arrays;
public class Main{
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
Matrix m1=new Matrix(in.nextInt(),in.nextInt());
System.out.println("row:"+m1.row+" column:"+m1.col);
for(int i=0;i<m1.row;i++) {
for(int j=0;j<m1.col;j++) {
m1.set(i+1, j+1, in.nextInt());
}
}
m1.set(in.nextInt(),in.nextInt(),in.nextInt());
System.out.println("after set value:");
m1.to();
int x=in.nextInt();
int y=in.nextInt();
System.out.println("value on ("+x+","+y+"):"+m1.get(x, y));
System.out.println("after add:");
Matrix m2=new Matrix(in.nextInt(),in.nextInt());
for(int i=0;i<m2.row;i++) {
for(int j=0;j<m2.col;j++) {
m2.set(i+1, j+1, in.nextInt());
}
}
Matrix t=m1.add(m2);
t.to();
Matrix m3=new Matrix(in.nextInt(),in.nextInt());
for(int i=0;i<m3.row;i++) {
for(int j=0;j<m3.col;j++) {
m3.set(i+1, j+1, in.nextInt());
}
}
System.out.println("after multiply:");
t=m1.multiply(m3);
t.to();
System.out.println("after transpose:");
t=m1.transpose();
t.to();
}
}
class Matrix{
int row;
int col;
int[][] a;
Matrix(int row,int col){
this.row=row;
this.col=col;
a=new int[row][col];
}
void set(int row, int col, int value) {
a[row-1][col-1]=value;
}
int get(int row,int col) {
return a[row-1][col-1];
}
int width() {
return col;
}
int height() {
return row;
}
Matrix add(Matrix b) {
Matrix temp=new Matrix(row,col);
for(int i=0;i<row;i++) {
for(int j=0;j<col;j++) {
temp.a[i][j]=a[i][j]+b.a[i][j];
}
}
return temp;
}
Matrix multiply(Matrix b) {
Matrix temp=new Matrix(row,b.col);
int sum;
for(int i=0;i<temp.row;i++) {
for(int j=0;j<temp.col;j++) {
sum=0;
for(int k=0;k<b.row;k++)
sum+=a[i][k]*b.a[k][j];
temp.a[i][j]=sum;
}
}
return temp;
}
Matrix transpose() {
Matrix temp=new Matrix(col,row);
for(int i=0;i<col;i++) {
for(int j=0;j<row;j++) {
temp.a[i][j]=a[j][i];
}
}
return temp;
}
void to() {
for(int i=0;i<row;i++) {
for(int j=0;j<col;j++) {
if(j==0)
System.out.print(a[i][j]);
else
System.out.print(" "+a[i][j]);
}
System.out.println();
}
}
}
设计BankAccount类
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int m = s.nextInt();
BankAccount c = new BankAccount(m);
int n = s.nextInt();
for (int i = 0; i < n; i++) {
int a = s.nextInt();
int money=s.nextInt();
switch (a) {
case 1:
c.deposit(money);
break;
case 2:
c.withdraw(money);
break;
default:
break;
}
System.out.println(c.getBlance());
}
}
}
/* 请在这里填写答案 */
class BankAccount
{
public int balance;
public BankAccount()
{
this.balance=0;
}
public BankAccount(int _balance)
{
this.balance=_balance;
}
public int getBlance()
{
return balance;
}
public int withdraw(int amount)
{
if(amount<=this.balance)
this.balance -= amount;
return this.balance;
}
public int deposit(int amount)
{
this.balance+=amount;
return this.balance;
}
}
Person类3
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
Person p = new Person();
for(int i=0;i<3;i++)
{
String name =sc.next();
String sex = sc.next();
int age = sc.nextInt();
p = new Person(name,sex,age);
}
System.out.println(p.getAvgAge());
}
}
class Person
{
private String name;
private String sex;
private int age;
private static int avgAge = 0;
public Person(){}
public Person(String _name,String _sex,int _age)
{
this.name=_name;
this.sex=_sex;
this.age=_age;
avgAge += _age;
}
public void setName(String _name)
{
this.name=_name;
}
public void setSex(String _sex)
{
this.sex=_sex;
}
public void setAge(int _age)
{
this.age=_age;
}
public int getAvgAge()
{
return avgAge/3;
}
public void print()
{
System.out.print("name:"+this.name+"; sex:"+this.sex+"; age:"+this.age);
}
}
Battery Charge
import java.util.Scanner;
import java.util.Arrays;
public class Main{
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
int[] a=new int[24];
for(int i=0;i<24;i++) {
a[i]=in.nextInt();
}
int start=in.nextInt();
int time=in.nextInt();
BatteryCharger x=new BatteryCharger(a);
int fee=x.getChargeCost(start, time);
System.out.println(fee);
int time2=in.nextInt();
int second=x.getChargeStartTime(time2);
System.out.print(second);
}
}
class BatteryCharger{
int[] cost;
int start;
int time;
BatteryCharger(int[] a){
this.cost=a;
}
int getChargeCost(int start, int time) {
int fee=0;
int day=0;
for(int i=0;i<24;i++)
day+=cost[i];
//System.out.println(day);
int n=time/24;
int mid=start+(time%24);
for(int i=start;i<mid;i++) {
if(i<=23)
fee+=cost[i];
else if(i>23)
fee+=cost[i%23-1];
}
return fee+n*day;
}
int getChargeStartTime(int time) {
int[] another=new int[24];
for(int i=0;i<24;i++) {
another[i]=getChargeCost(i,time);
}
// for(int i=0;i<24;i++) {
// System.out.print(another[i]+" ");
// }
// System.out.println();
int min=0;
for(int i=0;i<24;i++) {
if(another[min]>another[i])min=i;
}
return min;
}
}
卡片邻居游戏
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
CardGame cardgame=new CardGame();
int n=input.nextInt();
int[] a=new int[4];
//********************************************
for(int i=n;i>0;i--){//n次
//******************
for(int j=0;j<4;j++){
a[j]=input.nextInt();
}
NumberCard c=new NumberCard(a);//一张卡片
//*********************
c.mark=NumberCard.num++;
cardgame.insertCard(c);
}
//**********************************
cardgame.print();
}
}
class NumberCard {
public int[] number;
public int mark;
public int nextmark;
public int left, right;
public static int num = 2;
public NumberCard(int[] a) {
number = new int[4];
for (int i = 0; i < 4; i++) {
number[i] = a[i];
}
left = 0;
right = 0;
mark = 0;
nextmark = 0;
}
public NumberCard() {
number=new int[4];
left = 0;
right = 0;
mark = 0;
nextmark = 0;
}
public int getLeft() {
return number[3];
}
public int getRight() {
return number[1];
}
public void rotate() {
for (int i = 0; i < 4; i++) {
number[i] = number[(i - 1 + 4) % 4];
}
//下面是应该正确的写法
//int cnt=number[3];
//for (int i = 3; i >0; i--){
// number[i] = number[(i - 1 + 4) % 4];
//}
//number[0]=cnt;
}
}
class CardGame {
public NumberCard[] card;
public CardGame() {
card=new NumberCard[200];
for(int i=0;i<200;i++){
card[i]=new NumberCard();
}
card[0].nextmark = 1;
card[1].mark=1;
}
public int getIndexForFit(NumberCard c) {
for (int i = 4; i >0; i--)// 旋转次数
{
for (int j = 0; j != 1;)
{
boolean left = false, right = false;
NumberCard a = card[j], b = card[card[j].nextmark];
if (a.mark == 0 || a.number[1] == c.number[3])
left = true;
if (b.mark == 1 || b.number[3] == c.number[1])
right = true;
if (left==true && right==true)
{
return j;
}
j = card[j].nextmark;
}
c.rotate();
}
return -1;
}
public boolean insertCard(NumberCard c) {
int x = getIndexForFit(c);
if (x == -1)
return false;
c.nextmark = card[x].nextmark;
card[x].nextmark = c.mark;
card[c.mark]=c;
return true;
}
public void print() {
int x = card[0].nextmark;
boolean flag=false;
while (x != 1) {
for (int i = 0; i < 4; i++) {
if(flag==true)
System.out.print(" "+card[x].number[i]);
else
System.out.print(card[x].number[i]);
flag=true;
}
x=card[x].nextmark;
}
}
}
1！+2！+……+N！
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner input = new Scanner(System.in);
int n;
n = input.nextInt();
long result = 0;
while(n != 0)
{
result += func(n);
n--;
}
System.out.println(result);
}
public static int func(int n)
{
if(n == 0)
return 1;
else
return n*func(n-1);
}
}
完数
#include<stdio.h>
int main(){
int a,b,c,n;
scanf("%d",&n);
for(int i=1;i<n;i++){
int m=0;
for(int j=1;j<i;j++){
if(i%j==0){
m+=j;
}
}
if(m==i&&m==6){
printf("%d",m);
}
else if(m==i){
printf(",%d",m);
}
}
return 0;
}
n个a数字求和
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner input = new Scanner(System.in);
int n, a;
a = input.nextInt();
n = input.nextInt();
int result = 0;
while(n != 0)
{
int b = a, c = a;
for(int i = n-1; i > 0; i--)
b+=a*Math.pow(10,i);
result += b;
n--;
}
System.out.println(result);
}
}
数字统计
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner s= new Scanner(System.in);
String a = s.next();
int[] b = new int[10];
for(int i = 0; i < 10; i++)
b[i] = 0;
for(int i = 0; i < a.length(); i++)
{
int n = a.charAt(i) - '0';
b[n]++;
}
int k=0;
for(int i=0;i<10;i++) {
if(b[i]!=0)k=1;
if(k==1)System.out.print(b[i]);
}
}
}
7-26 一个整数各个位上的最大数字
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner s= new Scanner(System.in);
String a = s.next();
int max=0;
for(int i = 0; i < a.length(); i++)
{
int n = a.charAt(i) - '0';
if(n>max)max=n;
}
System.out.print(max);
}
}
7-27 十进制转二进制
import java.util.Scanner;
public class Main{
public static void main(String[] args){
int n;
Scanner scanner = new Scanner(System.in);
n = scanner.nextInt();
System.out.println(Integer.toBinaryString(n));
}
}
判断回文
import java.util.Scanner;//注意引入库
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sn = new Scanner(System.in);
String[] s = new String[300];//读入一个字符数组
String ss = sn.next();
int r = 0,l = ss.length()-1;
if(l == 0)
System.out.println("Yes");
else {
boolean flag = true;//定义flag
while(r < l)
{
//System.out.println(r);
//System.out.println(l);
if(ss.charAt(r) == ss.charAt(l)) {//使用字符数组
r++;l--;
}
else {
flag = false;
break;
}
}
if(!flag)
System.out.println("No");
else
System.out.println("Yes");
}
}
}
学投资
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner input = new Scanner(System.in);
int M = input.nextInt();
double P = input.nextDouble(), sum1, sum2, sum3;
int N = input.nextInt();
sum1 = M*(Math.pow(1+P, N));//复利
sum2 = M*(1+P*N);//非复利
sum3 = sum1>sum2? sum1-sum2: sum2-sum1;//多收入部分
System.out.print(Math.round(sum1)+" ");
System.out.print(Math.round(sum2)+" ");
System.out.print(Math.round(sum3));
}
}
打印所有的水仙花数
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
int i=100;
int a,b,c,t;
for(;i<1000;i++) {
t=i;
a=t%10;
t=t/10;
b=t%10;
c=t/10;
if((a*a*a+b*b*b+c*c*c)==i) {
if(i==153)
System.out.print(i);
else
System.out.print(","+i);
}
}
}
}
逆序输出整数
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
int i=in.nextInt();
int a;
for(;i>0;i--) {
a=in.nextInt();
for(;a>0;a=a/10) {
System.out.print(a%10);
}
System.out.println();
}
}
}
员工类
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int a,b;
Manager aa=new Manager(in.nextInt());
Salesman bb=new Salesman(in.nextInt(),in.nextInt());
Worker cc=new Worker(in.nextInt(),in.nextInt());
aa.getSalary();
bb.getSalary();
cc.getSalary();
}
}
class Employee{
int a=0;
public void getSalary() {
}
}
class Manager extends Employee{
Manager(int a){
this.a=a;
}
public void getSalary() {
System.out.println(this.a);
}
}
class Salesman extends Employee{
int b;
Salesman(int a,int b){
this.a=a;
this.b=b;
}
public void getSalary() {
System.out.println(this.a+this.b);
}
}
class Worker extends Employee{
int b;
Worker(int a,int b){
this.a=a;
this.b=b;
}
public void getSalary() {
System.out.println(this.a*this.b);
}
}
员工类-2
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int a,b;
Manager aa=new Manager(in.nextInt());
Salesman bb=new Salesman(in.nextInt(),in.nextInt());
Worker cc=new Worker(in.nextInt(),in.nextInt());
aa.getSalary();
bb.getSalary();
cc.getSalary();
}
}
class Employee{
int a=0;
public void getSalary() {
}
}
class Manager extends Employee{
Manager(int a){
this.a=a;
}
public void getSalary() {
System.out.println(this.a);
}
}
class Salesman extends Employee{
int b;
Salesman(int a,int b){
this.a=a;
this.b=b;
}
public void getSalary() {
System.out.println(this.a+this.b);
}
}
class Worker extends Employee{
int b;
Worker(int a,int b){
this.a=a;
this.b=b;
}
public void getSalary() {
System.out.println(this.a*this.b);
}
}
Shape类-2
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
double length = scan.nextDouble();
Shape s = new Square(length);
System.out.printf("%.2f ",s.getPerimeter());
System.out.printf("%.2f\n",s.getArea());
length = scan.nextDouble();
double wide = scan.nextDouble();
Shape r = new Rectangle(length,wide);
System.out.printf("%.2f ",r.getPerimeter());
System.out.printf("%.2f\n",r.getArea());
double radius = scan.nextDouble();
Shape c = new Circle(radius);
System.out.printf("%.2f ",c.getPerimeter());
System.out.printf("%.2f\n",c.getArea());
scan.close();
}
}
class Shape{
public double getPerimeter() {
return 1.0;
}
public double getArea() {
return 1.0;
}
}
class Square extends Shape{
double length;
Square(double length){
this.length=length;
}
public double getPerimeter() {
return 4*length;
}
public double getArea() {
return length*length;
}
}
class Rectangle extends Shape{
private double a,b;
public Rectangle (double a,double b) {
this.a=a;
this.b=b;
}
public double getPerimeter()
{
return 2*(a+b);
}
public double getArea()
{
return a*b;
}
}
class Circle extends Shape{
private double r;
double PI=3.1415926;
public Circle(double r)
{
this.r=r;
}
public double getPerimeter()
{
return 2*PI*r;
}
public double getArea()
{
return PI*r*r;
}
}
Shape类-3
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
double length = scan.nextDouble();
Shape s = new Square(length);
System.out.printf("%.2f ",s.getPerimeter());
System.out.printf("%.2f\n",s.getArea());
length = scan.nextDouble();
double wide = scan.nextDouble();
Shape r = new Rectangle(length,wide);
System.out.printf("%.2f ",r.getPerimeter());
System.out.printf("%.2f\n",r.getArea());
double radius = scan.nextDouble();
Shape c = new Circle(radius);
System.out.printf("%.2f ",c.getPerimeter());
System.out.printf("%.2f\n",c.getArea());
scan.close();
}
}
class Shape{
public double getPerimeter() {
return 1.0;
}
public double getArea() {
return 1.0;
}
}
class Square extends Shape{
double length;
Square(double length){
this.length=length;
}
public double getPerimeter() {
return 4*length;
}
public double getArea() {
return length*length;
}
}
class Rectangle extends Shape{
private double a,b;
public Rectangle (double a,double b) {
this.a=a;
this.b=b;
}
public double getPerimeter()
{
return 2*(a+b);
}
public double getArea()
{
return a*b;
}
}
class Circle extends Shape{
private double r;
double PI=3.1415926;
public Circle(double r)
{
this.r=r;
}
public double getPerimeter()
{
return 2*PI*r;
}
public double getArea()
{
return PI*r*r;
}
}
学生、大学生、研究生类-2
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int no,a;String name,sex;
no = scan.nextInt();
name = scan.next();
sex = scan.next();
String major = scan.next();
a=scan.nextInt();
CollegeStudent c = new CollegeStudent(no, name, sex, major,a);
c.getGrade();
no = scan.nextInt();
name = scan.next();
sex = scan.next();
major = scan.next();
String supervisor = scan.next();
a=scan.nextInt();
GraduateStudent g = new GraduateStudent(no, name, sex, major, supervisor ,a);
g.getGrade();
scan.close();
}
}
class Student{
int no;
String name,sex;
int s;
Student(int a,String b,String c,int s){
no=a;
name=b;
sex=c;
this.s=s;
}
public void print()
{
System.out.println("no: "+this.no);
System.out.println("name: "+name);
System.out.println("sex: "+sex);
}
public void getGrade()
{
int a=0;
if(s>=80&&s<=100) a=1;
if(s>=70&&s<80) a=2;
if(s>=60&&s<70) a=3;
if(s>=50&&s<60) a=4;
if(s<50) a=5;
char b='?';
switch (a)
{
case 1:b='A';break;
case 2:b='B';break;
case 3:b='C';break;
case 4:b='D';break;
case 5:b='E';break;
default:break;
}
System.out.println(b);
}
}
class CollegeStudent extends Student
{
public String major;
public CollegeStudent(int no,String name,String sex,String major ,int s)
{
super(no,name,sex,s);
this.major=major;
}
public void print()
{
super.print();
System.out.println("major: "+this.major);
}
public void getGrade()
{
int a=0;
if(s>=80&&s<=100) a=1;
if(s>=70&&s<80) a=2;
if(s>=60&&s<70) a=3;
if(s>=50&&s<60) a=4;
if(s<50) a=5;
char b='?';
switch (a)
{
case 1:b='A';break;
case 2:b='B';break;
case 3:b='C';break;
case 4:b='D';break;
case 5:b='E';break;
default:break;
}
System.out.println(b);
}
}
class GraduateStudent extends CollegeStudent
{
public String supervisor;
public GraduateStudent(int no,String name,String sex,String major,String supervisor,int s)
{
super(no,name,sex,major,s);
this.supervisor=supervisor;
}
public void print()
{
super.print();
System.out.println("supervisor: "+this.supervisor);
}
public void doResearch()
{
System.out.println(name+" is doing research");
}
public void getGrade()
{
int a=0;
if(s>=90&&s<=100) a=1;
if(s>=80&&s<90) a=2;
if(s>=70&&s<80) a=3;
if(s>=60&&s<70) a=4;
if(s<60) a=5;
char b='?';
switch (a)
{
case 1:b='A';break;
case 2:b='B';break;
case 3:b='C';break;
case 4:b='D';break;
case 5:b='E';break;
default:break;
}
System.out.println(b);
}
}
jmu-Java-04面向对象进阶--02-接口-Comparator
import java.util.*;
import java.lang.Comparable;
public class Main{
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n=in.nextInt();
PersonSortable2 p[]=new PersonSortable2[n];
for(int i=0;i<n;i++) {
String a=in.next();
int b=in.nextInt();
PersonSortable2 c=new PersonSortable2(a,b);
p[i]=c;
}
System.out.println("NameComparator:sort");
Arrays.sort(p,new NameComparator());
for(int i=0;i<n;i++) {
System.out.println(p[i]);}
System.out.println("AgeComparator:sort");
Arrays.sort(p,new AgeComparator());
for(int i=0;i<n;i++) {
System.out.println(p[i]);}
in.close();
System.out.println(Arrays.toString(NameComparator.class.getInterfaces()));
System.out.println(Arrays.toString(AgeComparator.class.getInterfaces()));
}}
class Rectangle implements Comparable{
int length,width;
Rectangle(int a,int b){
this.length=a;
this.width=b;
}
public int getArea(){
return this.length*this.width;
}
@Override
public int compareTo(Object o) {
Rectangle a=(Rectangle) o;
if(a.getArea()>this.getArea())
return 1;
if(a.getArea()<this.getArea())
return -1;
return 0;
}
}
class PersonSortable2{
String name;
int age;
PersonSortable2(String a,int b){
this.name=a;
this.age=b;
}
public String toString() {
return this.name+"-"+this.age;
}
}
class NameComparator implements Comparator<PersonSortable2>{
// public int compare(Object o1, Object o2) {
// // TODO Auto-generated method stub
// PersonSortable2 a=(PersonSortable2) o1;
// PersonSortable2 b=(PersonSortable2) o2;
// if(a.name.compareTo(b.name)>0)
// return 1;
// if(a.name.compareTo(b.name)<0)
// return 1;
// return 0;
// }
@Override
public int compare(PersonSortable2 o1, PersonSortable2 o2) {
// TODO Auto-generated method stub
if(o1.name.compareTo(o2.name)>0)
return 1;
if(o1.name.compareTo(o2.name)<0)
return -1;
return 0;
}
}
class AgeComparator implements Comparator{
@Override
public int compare(Object o1, Object o2) {
// TODO Auto-generated method stub
PersonSortable2 a=(PersonSortable2) o1;
PersonSortable2 b=(PersonSortable2) o2;
if(a.age>b.age)
return 1;
if(a.age<b.age)
return -1;
return 0;
}
}
家电类
import java.util.Comparator;
import java.util.Scanner;
import java.util.Arrays;
import java.util.LinkedList;
public class Main{
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int a=in.nextInt();
Appliance b[]=new Appliance[a];
int s=0;
for(int i=0;i<a;i++) {
int c=in.nextInt();
if(c==1) {
b[i]=new TV(in.nextInt());
s+=b[i].zhong();
}
else if(c==2) {
b[i]=new WashMachine(in.nextInt());s+=b[i].zhong();
}
else if(c==3) {
b[i]=new AirConditioner(in.nextInt());s+=b[i].zhong();
}
}
System.out.println(s);
}
}
interface Appliance{
public int zhong() ;
}
class TV implements Appliance{
int h;
TV(int a){
h=a;
}
@Override
public int zhong() {
// TODO Auto-generated method stub
return h;
}
}
class WashMachine implements Appliance{
int h;
WashMachine(int a){
h=a;
}
@Override
public int zhong() {
// TODO Auto-generated method stub
return h;
}
}
class AirConditioner implements Appliance{
int h;
AirConditioner(int a){
h=a;
}
@Override
public int zhong() {
// TODO Auto-generated method stub
return h;
}
}
教师类
import java.util.Comparator;
import java.util.Scanner;
import java.util.Arrays;
import java.util.LinkedList;
public class Main{
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
Teacher b1 = new Teacher(s.nextInt(),s.next(),s.nextInt(),s.next());
Teacher b2 = new Teacher(s.nextInt(),s.next(),s.nextInt(),s.next());
System.out.println(b1);
System.out.println(b2);
System.out.println(b1.equals(b2));
s.close();
}
}
class Teacher{
String name,s;
int a,no;
Teacher(int a,String b,int c,String d){
this.no=a;
this.name=b;
this.a=c;this.s=d;
}
public boolean equals(Teacher a) {
if(this.no==a.no) {
return true;
}
return false;
}
public String toString() {
return "no: "+this.no+", name:"+this.name+", age: "+this.a+", seminary: "+this.s;
}
}
教师类-2
import java.util.Comparator;
import java.util.Scanner;
import java.util.Arrays;
import java.util.LinkedList;
import java.lang.Comparable;
public class Main{
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n=in.nextInt();
Teacher b[]=new Teacher[n];
for(int i=0;i<n;i++) {
b[i] = new Teacher(in.nextInt(),in.next(),in.nextInt(),in.next());
}
Arrays.sort(b);
for(int i=0;i<n;i++) {
System.out.println(b[i]);
}
TeacherManagement e=new TeacherManagement(n);
String c=in.next();
e.add(b);
e.search(c);
e.search(in.nextInt());
in.close();
}
}
class Teacher implements Comparable{
String name,s;
int a,no;
Teacher(int a,String b,int c,String d){
this.no=a;
this.name=b;
this.a=c;this.s=d;
}
public boolean equals(Teacher a) {
if(this.no==a.no) {
return true;
}
return false;
}
public String toString() {
return "no: "+this.no+", name: "+this.name+", age: "+this.a+", seminary: "+this.s;
}
@Override
public int compareTo(Object o) {
Teacher a=(Teacher)o;
if(this.no>a.no)
return 1;
return -1;
}
}
class TeacherManagement{
Teacher a[];
int n;
TeacherManagement (int n){
this.n=n;
this.a=new Teacher[n];
}
public void add(Teacher b[]) {
this.a=b;
}
public void search(int age){
int flag = 0;
System.out.println("search by age:");
for (Teacher aT : a) {
if (aT.a == age) {
flag = 1;
System.out.println(aT.toString());
}
}
if(flag==0){
System.out.println("no such teacher");
}
}
public void search(String name){
int flag = 0;
System.out.println("search by name:");
for (Teacher aT : a) {
if (aT.name.equals(name)) {
flag = 1;
System.out.println(aT.toString());
}
}
if(flag==0){
System.out.println("no such teacher");
}
}
}
学生列表2
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.lang.Comparable;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
//
// int ops = sc.nextInt();
// for (int i=0;i<ops;i++) {
// String op = sc.next();
// if (op.equals("add"))
// cms.add(sc.nextInt(), sc.nextInt());
// else if (op.equals("delete"))
// cms.delete(sc.nextInt());
// else if (op.equals("query")) {
// int no = sc.nextInt();
// int s = cms.query(no);
// System.out.println("the score for "+no+" is : "+s);
// }
// }
// cms.statistic();
Caozuo c=new Caozuo();
int a=sc.nextInt();
for(int i=0;i<a;i++) {
Student b=new Student(sc.nextInt(),sc.next(),sc.nextInt());
c.add(b);}
a=sc.nextInt();
for(int i=0;i<a;i++) {
String b=sc.next();
if(b.equals("add")) {
Student d=new Student(sc.nextInt(),sc.next(),sc.nextInt());
c.add(d);
}
else if(b.equals("delete")) {
c.delete(sc.nextInt());
}
else {
c.set(sc.nextInt(), sc.nextInt());
}
}
Collections.sort(c.s);
c.shuchu();
}}
class Student implements Comparable{
int no,score;
String name;
Student(int no,String n,int s){
this.no=no;
this.name=n;
this.score=s;
}
public String toString() {
return "no:"+this.no+" name:"+this.name+" score:"+this.score;
}
public int hashCode() {
return no+1111;
}
public boolean equals(Object obj) {
Student aStudent = (Student)obj;
if(no == aStudent.no)
return true;
return false;
}
@Override
public int compareTo(Object o) {
Student a=(Student)o;
return this.no-a.no;
}
}
class Caozuo{
List<Student> s=new ArrayList<Student>();
public void add(Student a) {
s.add(a);
}
public void delete(int a) {
for(int i=0;i<s.size();i++) {
if(s.get(i).no==a)
s.remove(i);
}
}
public void set(int a,int b) {
for(int i=0;i<s.size();i++) {
if(s.get(i).no==a)
s.get(i).score=b;
}
}
public void shuchu() {
for(int i=0;i<s.size();i++) {
System.out.println(s.get(i));
}
}
}
office文档页码打印
import java.util.Iterator;
import java.util.Scanner;
import java.util.TreeSet;
public class Main {
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
TreeSet<Integer> s = new TreeSet<>();
String str = cin.nextLine();
String [] t = str.split(",");
for(int k = 0;k < t.length;k++){
int x = 0,n = t[k].length(),y = 0;
int id = -1;
for(int i = 0;i < n;i++){
char num = t[k].charAt(i);
if(num == '-'){
id = i;
break;
}
x = x * 10 + (int)num - 48;
}
if(id != -1){
for(int i = id+1;i < n;i++){
char num = t[k].charAt(i);
y = y * 10 + (int)num - 48;
}
if(x > y){
int tem = x;
x = y;
y = tem;
}
for(int i = x;i <= y;i++){
s.add(i);
}
}
else{
s.add(x);
}
}
Iterator<Integer> it = s.iterator();
int cnt = 0;
while(it.hasNext()){
if(cnt == 0){
System.out.print(it.next());
}
else{
System.out.print(" "+it.next());
}
cnt++;
}
}
}
sdust-Java-字符串集合求并集
//从键盘接收N个英文字符串（其中不同的字符串数量大于10），从头开始取5个不同的字符串放入一个集合S1，
//然后接着取5个不同的字符串放入另一个集合S2，按照字母顺序输出S1和S2的并集中的每个字符串（字符串区分大小写）
import java.util.*;
public class Main {
public static void main(String args[])
{
Scanner cin=new Scanner(System.in);
String s=cin.nextLine();
String []ns=s.split(" ");
Set<String> s1=new TreeSet<String>();//集合s1
Set<String> s2=new TreeSet<String>();//集合s2
for(int i=0;i<ns.length;i++)
{
if(s1.size()<5)
{
s1.add(ns[i]);
continue;
}
if(s2.size()<5)
{
s2.add(ns[i]);
continue;
}
}
s1.addAll(s2);//s2并入s1
/*for(Object i:s1)
{
System.out.println(i);
}*/
Iterator it=s1.iterator();
while(it.hasNext())
System.out.println(it.next());
cin.close();
}
}
学生Map
import java.util.*;
import java.lang.Comparable;
public class Main{
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
// Student[] stus = new Student[3];
//
// for(int i=0;i<3;i++){
// int no = scan.nextInt();
// String name = scan.next();
// Student s = new Student(no,name);
// stus[i] =s;
// }
// //将stus中的3个学生对象，放入到HashSet中
// HashSet<Student> stuSet = new HashSet<Student>();
// for(Student s: stus){
// stuSet.add(s);
// }
// //要放入的第4个Student
// Student fourth = new Student(scan.nextInt(),scan.next());
// stuSet.add(fourth);//如果fourth的学号（no）与stuSet中的已有学生的no重复则无法放入
// System.out.println(stuSet.size());
//
// Arrays.sort(stus);//对stus中的3个原有对象，按照姓名首字符有小到大排序
// for(int i=0;i<stus.length;i++){
// System.out.println(stus[i]);//输出的格式为：no=XX&name=YY
// }
HashMap<Integer,Student> a=new HashMap<Integer,Student>();
int n=scan.nextInt();
for(int i=0;i<n;i++) {
int no=scan.nextInt();
String name=scan.next();
int s=scan.nextInt();
a.put(no, new Student(no,name,s));
}
int k=scan.nextInt();
for(int i=0;i<k;i++) {
String b=scan.next();
if(b.equals("add")) {
int no=scan.nextInt();
String name=scan.next();
int s=scan.nextInt();
a.put(no, new Student(no,name,s));
}
else if(b.equals("delete")) {
a.remove(scan.nextInt());
}
else {
a.get(scan.nextInt()).xiugai(scan.nextInt());
}
}
for(Integer i:a.keySet()) {
System.out.println(a.get(i));}
scan.close();
}}
class Student implements Comparable{
int no,s;
String name;
Student(int a,String b,int c){
this.no=a;
this.name=b;
this.s=c;
}
public void xiugai(int a) {
this.s=a;
}
public String toString() {
return "no:"+this.no+" name:"+this.name+" score:"+this.s;
}
@Override
public int compareTo(Object o) {
// TODO Auto-generated method stub
Student a=(Student) o;
return this.no-a.no;
}
public int hashCode() {
return this.no;
}
public boolean equals(Object o) {
Student s=(Student) o;
if(this.no==s.no)
return true;
return false;
}
}
//class Rectangle implements Comparable{
// int length,width;
// Rectangle(int a,int b){
// this.length=a;
// this.width=b;
// }
// public int getArea(){
// return this.length*this.width;
// }
// @Override
// public int compareTo(Object o) {
// Rectangle a=(Rectangle) o;
// if(a.getArea()>this.getArea())
// return 1;
// if(a.getArea()<this.getArea())
// return -1;
// return 0;
// }
//}
//class PersonSortable2{
// String name;
// int age;
// PersonSortable2(String a,int b){
// this.name=a;
// this.age=b;
// }
// public String toString() {
// return this.name+"-"+this.age;
// }
//}
//class NameComparator implements Comparator<PersonSortable2>{
//
//
// public int compare(Object o1, Object o2) {
// // TODO Auto-generated method stub
// PersonSortable2 a=(PersonSortable2) o1;
// PersonSortable2 b=(PersonSortable2) o2;
// if(a.name.compareTo(b.name)>0)
// return 1;
// if(a.name.compareTo(b.name)<0)
// return 1;
// return 0;
// }
// @Override
// public int compare(PersonSortable2 o1, PersonSortable2 o2) {
// // TODO Auto-generated method stub
// if(o1.name.compareTo(o2.name)>0)
// return 1;
// if(o1.name.compareTo(o2.name)<0)
// return -1;
// return 0;
// }
//
//}
//class AgeComparator implements Comparator{
//
// @Override
// public int compare(Object o1, Object o2) {
// // TODO Auto-generated method stub
// PersonSortable2 a=(PersonSortable2) o1;
// PersonSortable2 b=(PersonSortable2) o2;
// if(a.age>b.age)
// return 1;
// if(a.age<b.age)
// return -1;
//
// return 0;
// }
//
//}
学生列表
import java.util.*;
import java.lang.Comparable;
public class Main{
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
// Student[] stus = new Student[3];
//
// for(int i=0;i<3;i++){
// int no = scan.nextInt();
// String name = scan.next();
// Student s = new Student(no,name);
// stus[i] =s;
// }
// //将stus中的3个学生对象，放入到HashSet中
// HashSet<Student> stuSet = new HashSet<Student>();
// for(Student s: stus){
// stuSet.add(s);
// }
// //要放入的第4个Student
// Student fourth = new Student(scan.nextInt(),scan.next());
// stuSet.add(fourth);//如果fourth的学号（no）与stuSet中的已有学生的no重复则无法放入
// System.out.println(stuSet.size());
//
// Arrays.sort(stus);//对stus中的3个原有对象，按照姓名首字符有小到大排序
// for(int i=0;i<stus.length;i++){
// System.out.println(stus[i]);//输出的格式为：no=XX&name=YY
// }
List<Student> a=new ArrayList<Student>();
int n=scan.nextInt();
for(int i=0;i<n;i++) {
int no=scan.nextInt();
String na=scan.next();
int s=scan.nextInt();
a.add(new Student(no,na,s));
}
n=scan.nextInt();
for(int i=0;i<n;i++) {
String b=scan.next();
if(b.equals("add")) {
a.add(new Student(scan.nextInt(),scan.next(),scan.nextInt()));
}
else if(b.equals("delete")) {
int k=a.size();
int c=scan.nextInt();
for(int j=0;j<k-1;j++) {
if(a.get(j).no==c)
a.remove(j);
}
}
else { int k=a.size();
int c=scan.nextInt();
for(int j=0;j<k-1;j++) {
if(a.get(j).no==c)
a.get(j).xiugai(scan.nextInt());
}
}
}
for(Student e:a) {
System.out.println(e);
}
}}
//for(Integer i:a.keySet()) {
// System.out.println(a.get(i));}
// scan.close();
//
class Student implements Comparable{
int no,s;
String name;
Student(int a,String b,int c){
this.no=a;
this.name=b;
this.s=c;
}
public void xiugai(int a) {
this.s=a;
}
public String toString() {
return "no:"+this.no+" name:"+this.name+" score:"+this.s;
}
@Override
public int compareTo(Object o) {
// TODO Auto-generated method stub
Student a=(Student) o;
return this.no-a.no;
}
public int hashCode() {
return this.no;
}
public boolean equals(Object o) {
Student s=(Student) o;
if(this.no==s.no)
return true;
return false;
}}
//class Rectangle implements Comparable{
// int length,width;
// Rectangle(int a,int b){
// this.length=a;
// this.width=b;
// }
// public int getArea(){
// return this.length*this.width;
// }
// @Override
// public int compareTo(Object o) {
// Rectangle a=(Rectangle) o;
// if(a.getArea()>this.getArea())
// return 1;
// if(a.getArea()<this.getArea())
// return -1;
// return 0;
// }
//}
//class PersonSortable2{
// String name;
// int age;
// PersonSortable2(String a,int b){
// this.name=a;
// this.age=b;
// }
// public String toString() {
// return this.name+"-"+this.age;
// }
//}
//class NameComparator implements Comparator<PersonSortable2>{
//
//
// public int compare(Object o1, Object o2) {
// // TODO Auto-generated method stub
// PersonSortable2 a=(PersonSortable2) o1;
// PersonSortable2 b=(PersonSortable2) o2;
// if(a.name.compareTo(b.name)>0)
// return 1;
// if(a.name.compareTo(b.name)<0)
// return 1;
// return 0;
// }
// @Override
// public int compare(PersonSortable2 o1, PersonSortable2 o2) {
// // TODO Auto-generated method stub
// if(o1.name.compareTo(o2.name)>0)
// return 1;
// if(o1.name.compareTo(o2.name)<0)
// return -1;
// return 0;
// }
//
//}
//class AgeComparator implements Comparator{
//
// @Override
// public int compare(Object o1, Object o2) {
// // TODO Auto-generated method stub
// PersonSortable2 a=(PersonSortable2) o1;
// PersonSortable2 b=(PersonSortable2) o2;
// if(a.age>b.age)
// return 1;
// if(a.age<b.age)
// return -1;
//
// return 0;
// }
//
//}
镜像字符串
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner cin=new Scanner(System.in);
String s1=cin.next();
String s2=cin.next();
String ns1=new StringBuffer(s1).reverse().toString();
if(ns1.equals(s2))
System.out.println("yes");
else System.out.println("no");
cin.close();
}
}
单词在句子中的位置
import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
String s=sc.nextLine();
Statistics st=new Statistics();
st.wordPositions(s);
sc.close();
}
}
class Statistics{
int []count;//统计单词长度
String []ns;//纪录单词
List<Integer>pos =new LinkedList<>();//记录单词出现位置
public Statistics() {
count=new int[100];
}
public void wordPositions(String sentence)
{
for (int i = 0; i < sentence.length() ; i++) {
if(i==0)
{
pos.add(i);
}
else if(sentence.charAt(i-1)==' ')
{
pos.add(i);
}
}
ns=sentence.split(" ");//将句子转化为字符串数组
for (int i = 0; i < ns.length ; i++) {
count[i]=ns[i].length();
}
for (int i = 0; i <ns.length ; i++) {
System.out.println(ns[i]+": "+pos.get(i)+", "+count[i]);
}
}
}
/*Why are you so crazy about java*/
7-62 字符串
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
String s=sc.nextLine();
String strc=sc.nextLine();//待输入字母，因为Java中没有直接读取单个字符的函数，
//所以将字母输入到字符串中，调用String中的charAt()函数
//取第一个字符即为我们想要输入的单个字符
char c=strc.charAt(0);
String str=sc.nextLine();
char []ns=s.toCharArray();
int count=0;
// System.out.println(ns);
for (int i = 0; i < ns.length ; i++) {
if(ns[i]==c){
count++;
}
}
System.out.println(count);
for (int i = 0; i < ns.length/2 ; i++) {
char temp=ns[i];
ns[i]=ns[ns.length-i-1];
ns[ns.length-i-1]=temp;
}
System.out.println(ns);
int head=0;
int []arr=new int[s.length()];
String []nns=s.split(" ");//将句子中的各个单词分隔
int j=0;
int preStrLength=0;
while(true)
{
//indexOf——返回指定字符第一次出现的字符串内的索引
int n = s.indexOf(str);
//找不到返回-1，循环结束
if (n == -1) {
break;
}
//存储找到的值（下标）
//arr[j++]=n;
//第一次head=0，从0开始找，之后head变为下标n+要找字符串的长度
//应该从这里开始查找该子串，不加长度会出问题的！
//head = n + str.length();
if(j != 0)
System.out.print(' ');
//break;
System.out.print((n + preStrLength));//字符串位置
j++;
s= s.substring(n +str.length());//截取
preStrLength +=(n +str.length());
}
// System.out.print(arr[0]);
// for (int i = 1; i < j ; i++) {
// System.out.print(" " + arr[i]);
// }
System.out.println();
String s1=new String();
for (int i = 0; i < nns.length ; i++) {
if(i==nns.length-1)
s1+=nns[i].substring(0,1).toUpperCase()+nns[i].substring(1);
else
s1+=nns[i].substring(0,1).toUpperCase()+nns[i].substring(1)+" ";
}
System.out.println(s1);
sc.close();
}
}
/*I scream you scream we all scream for icecream
m
eam*/
7-63 测试抛出异常
import java.util.*;
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner in=new Scanner(System.in);
int n=in.nextInt();
int[] a=new int[n];
for(int i=0;i<n;i++){
a[i]=in.nextInt();
}
int m=in.nextInt();
ArrayUtil aaa=new ArrayUtil();
for(int i=0;i<m;i++){
int low=in.nextInt();
int high=in.nextInt();
aaa.findMax(a,low,high);
}
}
}
class ArrayUtil{
public ArrayUtil() {//构造函数
}
public void findMax(int[] arr, int begin, int end) {
if(begin>=end) {
System.out.println("java.lang.IllegalArgumentException: begin:"+begin+" >= end:"+end);
}else if(begin<0) {
System.out.println("java.lang.IllegalArgumentException: begin:"+begin+" < 0");
}else if(end>arr.length) {
System.out.println("java.lang.IllegalArgumentException: end:"+end+" > arr.length");
}else{
int max=-9999;
for(int i=begin;i<end;i++) {
if(arr[i]>max) {
max=arr[i];
}
}
System.out.println(max);
}
}
}
7-64 InputMismatchException异常
import java.util.InputMismatchException;
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
boolean isTrue = true;
while (isTrue) {
try {
int a = input.nextInt();
int b = input.nextInt();
System.out.println("sum = "+(a+b));// 输入的数字不是整数时不会往下执行，跳转到catch语句块中执行
} catch (InputMismatchException e) {
System.out.println("Incorrect input: two integer is required");
input.nextLine();// 清空输入的数字
}
}
}
}
jmu-Java-06异常-01-常见异常
import java.util.Scanner;
public class Main {
public static void main(String []args){
int []a={1,2,3,4,5};
Scanner sc = new Scanner(System.in);
String next = sc.next();
while (!next.equals("other")){
if (next.equals("arr")) {
try {
a[sc.nextInt()]=2;
} catch (ArrayIndexOutOfBoundsException e){
System.out.println(e);
}
next= sc.next();
}
else if(next.equals("null")){
try {
throw new NullPointerException();
} catch (NullPointerException e){
System.out.println(e);
}
next= sc.next();
}
else if(next.equals("cast")){
try {
Object ss = new String("woshichaoren");//⚠️注意这里
Integer b = (Integer) ss;
} catch (ClassCastException e){
System.out.println(e);
}
next=sc.next();
}
else if(next.equals("num")){
try {
int c=Integer.parseInt(sc.next());
} catch (NumberFormatException e){
System.out.println(e);
}
next= sc.next();
}
else
break;
}
}
}
jmu-Java-06异常-04-自定义异常(综合)
import java.util.Scanner;
import java.util.NoSuchElementException;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
while (true){
if (scan.nextLine().equals("new")){
try {
String[] str = scan.nextLine().split(" ");
if (str.length!=2) throw new NoSuchElementException();
Student stu = new Student();
stu.setName(str[0]);
stu.addScore(Integer.parseInt(str[1]));
System.out.println(stu);
} catch (Exception e) {
System.out.println(e);
}
}else break;
}
scan.close();
System.out.println("scanner closed");
}
}
class Student{
private String name;
private int score;
public String getName() {
return name;
}
//如果姓名首字母为数字则抛出IllegalNameException
public void setName(String name) throws IllegalNameException{
if (name.charAt(0)>=48&&name.charAt(0)<=57)
throw new IllegalNameException("the first char of name must not be digit, name=" + name);
this.name = name;
}
public int getScore() {
return score;
}
public void setScore(int score) {
this.score = score;
}
public int addScore(int score) throws IllegalScoreException{
this.setScore(this.getScore() + score);
if (this.getScore()<0||this.getScore()>100)
throw new IllegalScoreException("score out of range, score=" + score);
return this.getScore();
}
@Override
public String toString() {
return "Student [" +"name=" + name + ", score=" + score+"]" ;
}
}
class IllegalScoreException extends Exception{
public IllegalScoreException() {
super();
}
public IllegalScoreException(String message) {
super(message);
}
}
class IllegalNameException extends Exception{
public IllegalNameException() {
super();
}
public IllegalNameException(String message) {
super(message);
}
}
设计一个Tiangle异常类
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
double s1 = input.nextDouble();
double s2 = input.nextDouble();
double s3 = input.nextDouble();
try {
Triangle t = new Triangle(s1,s2,s3);
System.out.println(t);
}catch (IllegalTriangleException ex) {
System.out.println(ex.getMessage());
}
}
}
class IllegalTriangleException extends Exception{
private double side1;
private double side2;
private double side3;
public IllegalTriangleException(double side1,double side2 ,double side3) {
super("Invalid: "+side1+","+side2+","+side3);//message是父类成员变量，使用super向上传参!
this.side1=side1;
this.side2=side2;
this.side3=side3;
}
}
class Triangle{
private double side1;
private double side2;
private double side3;
public Triangle(double side1,double side2,double side3)
throws IllegalTriangleException{
if((side1+side2)>side3&(side1+side3)>side2&(side2+side3)>side1)
{this.side1=side1;this.side2=side2;this.side3=side3;}
else
throw new IllegalTriangleException(side1,side2,side3);
}
@Override
public String toString(){
return "Triangle ["+"side1="+this.side1+", side2="+this.side2+", side3="+this.side3+"]";
}
}
打印双休日
import java.text.ParseException;
import java.text.SimpleDateFormat;
import java.text.ParsePosition;
import java.util.Calendar;
import java.util.Scanner;
import java.util.Date;
public class Main{
public static void main(String[] args) throws ParseException {
Scanner input=new Scanner(System.in);
// int year=input.nextInt();
// int month=input.nextInt();
String str=input.nextLine();
SimpleDateFormat df1=new SimpleDateFormat("yyyy MM");//输入形式
SimpleDateFormat df2=new SimpleDateFormat("yyyy-MM-dd");//输出形式
Calendar cal=Calendar.getInstance();//使用默认时区和区域设置获取日历。
cal.clear();// 将此 Calendar 的所日历字段值和时间值（从历元至现在的毫秒偏移量）设置成未定义。
cal.setTime(df1.parse(str));// 使用给定的 Date 设置此 Calendar 的时间。
// parse(String text, ParsePosition pos) 解析字符串的文本，生成 Date。
for (int i = 0; i < cal.get(Calendar.DAY_OF_MONTH); i++) {//查询范围为某月
if(cal.get(Calendar.DAY_OF_WEEK)==Calendar.SATURDAY||cal.get(Calendar.DAY_OF_WEEK)==Calendar.SUNDAY)
{
System.out.println(df2.format(cal.getTime()));// 返回一个表示此 Calendar 时间值（从历元至现在的毫秒偏移量）的 Date 对象。
}
cal.add(Calendar.DAY_OF_MONTH,1);//天数+1
}
input.close();
}
}
Duplicated Words
public static ArrayList<String> pick(ArrayList<String> a) {
ArrayList<String> rs = new ArrayList<String>();
for(int i=0;i<a.size();i++) {
if(!rs.contains(a.get(i))) {
rs.add(a.get(i));
}
}
Collections.sort(rs);
Collections.reverse(rs);
return rs;
}
约瑟夫环问题-hebust
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String []args)
{
Scanner cin=new Scanner(System.in);
int a=cin.nextInt();
cin.nextLine();
String s=cin.nextLine();
String []ns=s.split(",");
List arrayList=new ArrayList<String>();
for(int i=0;i<ns.length;i++)
{
arrayList.add(ns[i]);
}
int f=0;//记录每个人报的数
while(arrayList.size()>0)
{
Iterator it=arrayList.iterator();
while (it.hasNext())
{
String nns=(String)it.next();
if(f==a-1)
{
if( arrayList.size() > 1) {
System.out.print(nns + ",");
}
else {
System.out.println(nns);
}
it.remove();
}
f = ( f + 1) % a;
}
}
cin.close();
}
}
找出最长的单词-hebust
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
String s = cin.nextLine();
String []str = s.split(" ");
int max = str[0].length();
String maxs=str[0];
for(String i:str)
{
if(i.length()>max)
max=i.length();
maxs=i;
}
System.out.println(maxs);
cin.close();
}
}
扫一扫
2158
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
