专栏首页机器学习入门LWC 51:682. Baseball Game

LWC 51:682. Baseball Game

LWC 51:682. Baseball Game

传送门:682. Baseball Game

Problem:

You’re now a baseball game point recorder. Given a list of strings, each string can be one of the 4 following types:

  1. Integer (one round’s score): Directly represents the number of points you get in this round.
  2. “+” (one round’s score): Represents that the points you get in this round are the sum of the last two valid round’s points.
  3. “D” (one round’s score): Represents that the points you get in this round are the doubled data of the last valid round’s points.
  4. “C” (an operation, which isn’t a round’s score): Represents the last valid round’s points you get were invalid and should be removed. Each round’s operation is permanent and could have an impact on the round before and the round after.

You need to return the sum of the points you could get in all the rounds.

Example 1:

Input: [“5”,”2”,”C”,”D”,”+”] Output: 30 Explanation: Round 1: You could get 5 points. The sum is: 5. Round 2: You could get 2 points. The sum is: 7. Operation 1: The round 2’s data was invalid. The sum is: 5. Round 3: You could get 10 points (the round 2’s data has been removed). The sum is: 15. Round 4: You could get 5 + 10 = 15 points. The sum is: 30.

Example 2:

Input: [“5”,”-2”,”4”,”C”,”D”,”9”,”+”,”+”] Output: 27 Explanation: Round 1: You could get 5 points. The sum is: 5. Round 2: You could get -2 points. The sum is: 3. Round 3: You could get 4 points. The sum is: 7. Operation 1: The round 3’s data is invalid. The sum is: 3. Round 4: You could get -4 points (the round 3’s data has been removed). The sum is: -1. Round 5: You could get 9 points. The sum is: 8. Round 6: You could get -4 + 9 = 5 points. The sum is 13. Round 7: You could get 9 + 5 = 14 points. The sum is 27.

Note:

The size of the input list will be between 1 and 1000.

Every integer represented in the list will be between -30000 and 30000.

思路: straightforward,题意即思路。

代码如下:

    public int calPoints(String[] ops) {
        List<Integer> ans = new ArrayList<>();
        for (int i = 0; i < ops.length; ++i) {
            String val = ops[i];
            if (val.equals("C")) {
                ans.remove(ans.size() - 1);
            }
            else if (val.equals("D")) {
                int last = ans.get(ans.size() - 1);
                ans.add(last * 2);
            }
            else if (val.equals("+")) {
                int last = ans.get(ans.size() - 1);
                int prev = ans.get(ans.size() - 2);
                ans.add(last + prev);
            }
            else {
                int num = Integer.parseInt(val);
                ans.add(num);
            }
        }

        int sum = 0;
        for (int i = 0; i < ans.size(); ++i) {
            sum += ans.get(i);
        }
        return sum;
    }

数组的长度其实是已知的,所以直接用指针动态增减,代码如下:

    public int calPoints(String[] ops) {
        int n = ops.length;
        int[] list = new int[n + 1];
        int tot = 0;
        for (int i = 0; i < n; ++i) {
            String val = ops[i];
            if (val.equals("C")) {
                tot--;
            }
            else if (val.equals("D")) {
                int lst = list[tot - 1];
                list[tot++] = lst * 2;
            }
            else if (val.equals("+")) {
                int lst = list[tot - 1];
                int prv = list[tot - 2];
                list[tot++] = lst + prv;
            }
            else {
                int num = Integer.parseInt(val);
                list[tot++] = num;
            }
        }

        int sum = 0;
        for (int i = 0; i < tot; ++i) {
            sum += list[i];
        }

        return sum;
    } 

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

我来说两句

0 条评论
登录 后参与评论

相关文章

  • LWC 52:688. Knight Probability in Chessboard

    LWC 52:688. Knight Probability in Chessboard 传送门:688. Knight Probability in Ches...

    用户1147447
  • 挑战程序竞赛系列(16):3.1最大化最小值

    版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.n...

    用户1147447
  • POJ 刷题系列:3349. Snowflake Snow Snowflakes

    版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/...

    用户1147447
  • 【Java案例】打印杨辉三角

    根据输入行数,打印出杨辉三角形,如图1.10所示。 ? 图1.10 杨辉三角形 案例分析 观察杨辉三角形的图案,可以发现其中的规律:三角形的竖边和斜边都是“1...

    奋斗蒙
  • 2017年度盘点丨基础架构演化:从“以资源为中心”到“以应用为中心”的迁移...

    谈到基础架构,不同的人有不同的理解。一般说来,我们将支撑应用研发部署的底层软硬件的集合叫做基础架构。它不仅涉及到IDC、机房、机架、网络、主机、存储等硬件资源,...

    钱曙光
  • 2017年度盘点丨基础架构演化:从“以资源为中心”到“以应用为中心”的迁移

    作者:刘建,搜狗架构师,商业平台基础平台负责人,十多年Java相关研发经验,在互联网软件体系结构、分布式计算、面向服务体系结构、用户身份安全等方面有浓厚的兴趣及...

    CSDN技术头条
  • 可能是你见过的最完善的微前端解决方案

    技术栈无关:主框架不限制接入应用的技术栈,子应用具备完全自主权 独立开发、独立部署:子应用仓库独立,前后端可独立开发,部署完成后主框架自动完成同步更新 独立运行...

    用户4962466
  • 运营app,第一步要做什么?【从0开始运营APP之①】

    无论是大公司还是小企业,从0开始推广一个APP,都要经历一个创业过程——时刻面临人少、缺资源,“无推广预算”的窘境。腾讯云分析从这个月开始,将推出【从0开始运...

    腾讯大数据
  • 【CCF】数位之和

    版权声明:本文为博主原创文章,遵循 CC 4.0 BY-SA 版权协议,转载请附上原文出处链接和本声明。 ...

    喜欢ctrl的cxk
  • 应用长时间未调用后再次调用出现hang的情况

            之前某应用就存在长时间不调用,再次调用时处于hang,等待10分钟返回3113的连接错误。今天正好同事也问了个相同的问题,也是应用长时间不调用就...

    bisal

扫码关注云+社区

领取腾讯云代金券