zoukankan      html  css  js  c++  java
  • Baseball Game

    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.
     1 public int calPoints(String[] ops) {
     2         if(ops == null || ops.length == 0)
     3             return 0;
     4         int []points = new int[ops.length];
     5         int point = -1;
     6         int sum = 0;
     7         for(String op : ops){
     8             if(op.equals("+")){
     9                 sum = points[point] + points[point - 1];
    10                 points[++ point] = sum;
    11             }else if(op.equals("D")){
    12                 sum = points[point] * 2;
    13                 points[++ point] = sum;
    14             }else if(op.equals("C")){
    15                 point --;
    16             }else{
    17                 points[++point] = Integer.parseInt(op);
    18             }
    19         }
    20         sum = 0;
    21         for(int i = 0; i <= point; i++){
    22             sum += points[i];
    23         }
    24         return sum;
    25     }

     优化,少遍历一遍

     1 public int calPoints(String[] ops) {
     2         if(ops == null || ops.length == 0)
     3             return 0;
     4         int []points = new int[ops.length];
     5         int point = -1;
     6         int sum = 0;
     7         int temp = 0;
     8         for(String op : ops){
     9             if(op.equals("+")){
    10                 temp = points[point] + points[point - 1];
    11                 points[++point] = temp;
    12                 sum += temp;
    13             }else if(op.equals("D")){
    14                 temp = points[point] * 2;
    15                 points[++ point] = temp;
    16                 sum += temp;
    17             }else if(op.equals("C")){
    18                 sum -= points[point];
    19                 point --;
    20             }else{
    21                 points[++point] = Integer.parseInt(op);
    22                 sum += points[point];
    23             }
    24         }
    25         return sum;
    26     }
  • 相关阅读:
    什么是线程池?
    线程包括哪些状态?状态之间是如何变化的?
    C语言中的文本流与二进制流的区别
    Windows+IIS结合LVS+Keepalived是实现Linux负载均衡软件
    Linux中的lo回环接口详细介绍
    Keepalived原理与实战精讲
    分布式文件系统MFS(moosefs)实现存储共享(第二版)
    C语言缓冲区(缓存)详解
    Android如何防止apk程序被反编译
    Android APK反编译详解(附图)
  • 原文地址:https://www.cnblogs.com/luckygxf/p/7747450.html
Copyright © 2011-2022 走看看