华为OD 机试3题(通过率60%,80%,75%)


import java.util.List;
import java.util.Scanner;
import java.util.*;
class Points{
    int x;
    int y;

    public Points(int x, int y) {
        this.x = x;
        this.y = y;
    }

    public int getX() {
        return x;
    }

    public void setX(int x) {
        this.x = x;
    }

    public int getY() {
        return y;
    }

    public void setY(int y) {
        this.y = y;
    }
    public int getArea(){
        return x*x+y*y;
    }
}
public class Test {
    // 本题为考试单行多行输入输出规范示例,无需提交,不计分。
    public static boolean judge(int a,int b,Set set){
        if(set.contains(a)&&set.contains(b))
            return true;
        return false;
    }

    public static void main(String[] args) {
        test1();
        test2();
        test3();
    }

    public static void test3(){
        Scanner in = new Scanner(System.in);
        while (in.hasNext()) {// 注意,如果输入是多个测试用例,请通过while循环处理多个测试用例
            Set set=new HashSet();
            String all=in.nextLine();
            String[] array=all.split(" ");
            int n=Integer.valueOf(array[0]);
            int m=Integer.valueOf(array[1]);
            if(n<1||m<1||n>100000||m>100000)
                System.out.println("NULL");
            else{
                for(int i=0;in||b>n||(c!=1&&c!=0)){
                        System.out.println("da pian zi");
                    }else{
                        if(c==0){
                            set.add(a);
                            set.add(b);
                        }else{
                            //判断是否是一个队伍
                            if(judge(a,b,set)){
                                System.out.println("we are a team");
                            }else{
                                System.out.println("we are not a team");
                            }
                        }
                    }
                }
            }
        }
    }
    public static void test1() {
        Scanner in = new Scanner(System.in);
        while (in.hasNext()) {// 注意,如果输入是多个测试用例,请通过while循环处理多个测试用例
            String all=in.nextLine();
            String[] array=all.split(",");
            //排序
            int size=array.length;
            for(int i=0;i0){
                            exchange(array,i,j);
                        }
                    }
                   else if(array[i].compareTo(array[j])>0){
                        exchange(array,i,j);
                    }
                }
            }

            StringBuffer sb=new StringBuffer();
            for(int i=array.length-1;i>=0;i--){
                sb.append(array[i]);
            }
            System.out.println(sb.toString());
        }
    }
    public static void exchange(String[] array,Integer i,Integer j){
        String temp=array[j];
        array[j]=array[i];
        array[i]=temp;
    }

    public static void test2(){
        Scanner in = new Scanner(System.in);
        while (in.hasNext()) {// 注意,如果输入是多个测试用例,请通过while循环处理多个测试用例
            List list=new ArrayList();
            String all=in.nextLine();
            char[] array=all.toCharArray();
            int start=0,end=0;
            for(int i=0;i0&&end>0){
                    String b=all.substring(start,end);
                    String[] split = b.split(",");
                    if(split[0].startsWith("0")||split[1].startsWith("0")){
                        continue;
                    }else{
                        list.add(new Points(Integer.valueOf(split[0]),Integer.valueOf(split[1])));
                    }
                    start=0;
                    end=0;
                }
            }
            if(list.size()==0){
                System.out.println("(0,0)");
            }
            else{
                list.sort(Comparator.comparing(Points::getArea).reversed());
                Points points = list.get(0);
                System.out.println("("+points.getX()+","+points.getY()+")");
            }
        }
    }
}

你可能感兴趣的:(算法,华为,java,开发语言)