JavaSE信息热搜排行练习

 

 calss

package com.itheima.zy;

import java.util.*;


public class Demo6 {
    public static void main(String[] args) {
        TreeSet<News> news = new TreeSet<>();
        news.add(new News("备孕者可以接种疫苗", 480));
        news.add(new News("土耳其召见中国,中方回应", 475));
        news.add(new News("日本大阪将取消奥运会火炬传递活动", 447));
        news.add(new News("杀人犯纸面服刑15年 84人担责", 431));
        news.add(new News("好利来辟谣卷入西藏那冒险王事件", 416));
        news.add(new News("湖北全球特别推介活动4月12日亮相", 402));
        news.add(new News("2名中国旷工在尼日利亚遭绑架", 388));
        news.add(new News("一季度北京平均月薪达11187元", 374));
        news.add(new News("巴西侨领张伟遭枪击遇害", 361));
        news.add(new News("浦东车管所称特斯拉目前上牌正常", 348));

        while (true) {
            System.out.println("==================百度热搜================");
            TreeSet<News> news2 = new TreeSet<>();

            for (News n : news) {
                news2.add(n);
            }
            for (News news1 : news2) {
                System.out.println(news1);
            }
            System.out.println("请选择需要查看的新闻:");
            Scanner sc = new Scanner(System.in);
            String next = sc.next();
            boolean pd = getT(news, next);


            if (pd) {
                Scanner sc1 = new Scanner(System.in);
                System.out.println("请输入需要的操作:1.点赞,2.评论,3.收藏");
                int num = sc1.nextInt();
                switch (num) {
                    case 1:
                        for (News news1 : news) {
                            if (news1.getTitle().contains(next)) {
                                int conut = news1.getConut();
                                news1.setConut(conut + 3);
                            }
                        }

                        break;
                    case 2:
                        for (News news1 : news) {
                            if (news1.getTitle().contains(next)) {
                                int conut = news1.getConut();
                                news1.setConut(conut + 5);
                            }
                        }
                        break;
                    case 3:
                        for (News news1 : news) {
                            if (news1.getTitle().contains(next)) {
                                int conut = news1.getConut();
                                news1.setConut(conut + 8);
                            }
                        }
                        break;
                    default:
                        break;
                }
            } else {
                System.out.println("不存在该新闻");
                break;
            }
        }

    }

    public static boolean getT(TreeSet<News> treeSet, String s) {
        for (News news : treeSet) {
            if (news.getTitle().contains(s)) {
                return true;
            }
        }
        return false;
    }
}

News类

package com.itheima.zy;

public class News implements Comparable<News>{
    private String title;
    private int conut;

    public News() {
    }

    public News(String title, int conut) {
        this.title = title;
        this.conut = conut;
    }

    public String getTitle() {
        return title;
    }

    public void setTitle(String title) {
        this.title = title;
    }

    public int getConut() {
        return conut;
    }

    public void setConut(int conut) {
        this.conut = conut;
    }

    @Override
    public String toString() {
        return "News{" +
                "title='" + title + '\'' +
                ", conut=" + conut +
                '}';
    }

    @Override
    public int compareTo(News o) {
        int result = o.getConut() - this.getConut();
        result = result == 0 ? o.getTitle().compareTo(this.getTitle()) : result;
        return result;
    }
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值