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 条评论
登录 后参与评论

相关文章

来自专栏算法修养

HDU 5675 ztr loves math

ztr loves math Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65...

3786
来自专栏数据结构与算法

2189 数字三角形W

2189 数字三角形W 时间限制: 1 s 空间限制: 32000 KB 题目等级 : 黄金 Gold 题目描述 Description 数字三角...

2457
来自专栏算法修养

HDU 5658 CA Loves Palindromic(回文树)

CA Loves Palindromic Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 26...

3294
来自专栏ml

HDUOJ-----1066Last non-zero Digit in N!

Last non-zero Digit in N! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit...

3146
来自专栏数据结构与算法

POJ 3207 Ikki's Story IV - Panda's Trick(2-SAT)

Description liympanda, one of Ikki’s friend, likes playing games with Ikki. Toda...

3536
来自专栏ml

hust--------The Minimum Length (最短循环节)(kmp)

F - The Minimum Length Time Limit:1000MS     Memory Limit:131072KB     64bit I...

2383
来自专栏算法修养

HDU 5651 xiaoxin juju needs help

xiaoxin juju needs help Time Limit: 2000/1000 MS (Java/Others)    Memory Limit:...

2707
来自专栏算法修养

HDU 3309 Roll The Cube(bfs)

Roll The Cube Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/327...

34613
来自专栏ml

poj-----(2828)Buy Tickets(线段树单点更新)

Buy Tickets Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 1...

33612
来自专栏ml

HDUOJ---A + B Again

A + B Again Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 ...

27311

扫码关注云+社区