zoukankan      html  css  js  c++  java
  • LeetCode Baseball Game

    原题链接在这里:https://leetcode.com/problems/baseball-game/description/

    题目:

    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.

    题解:

    需要维护住最后两个valid的数字. 可以使用queue也可以使用stack.

    Time Complexity: O(ops.length).

    Space: O(ops.length).

    AC Java:

     1 class Solution {
     2     public int calPoints(String[] ops) {
     3         if(ops == null || ops.length == 0){
     4             return 0;
     5         }
     6         
     7         int res = 0;
     8         LinkedList<Integer> que = new LinkedList<Integer>();
     9         for(String op : ops){
    10             if(op.equals("C")){
    11                 res -= que.removeLast();
    12             }else if(op.equals("D")){
    13                 que.add(que.peekLast()*2);
    14                 res += que.peekLast();
    15             }else if(op.equals("+")){
    16                 que.add(que.peekLast() + que.get(que.size()-2));
    17                 res += que.peekLast();
    18             }else{
    19                 que.add(Integer.valueOf(op));
    20                 res += que.peekLast();
    21             }
    22         }
    23         
    24         return res;
    25     }
    26 }
  • 相关阅读:
    hnoi2013
    图片屏幕LibGdxGearJoint齿轮关节
    数据属性WEKA学习总结
    函数调用[置顶] C/C++在main函数之前和之后会做些什么
    系统控制2013北京照明展后记
    终端安装解决svn "cannot set LC_CTYPE locale"的问题
    系统服务器Fedora和Red Hat Enterprise Linux实用指南(第6版)(上、下册)( 入行必读的Linux圣经)
    文件数据库Android面试题(三)
    UML中的活动图
    UML模型
  • 原文地址:https://www.cnblogs.com/Dylan-Java-NYC/p/7648517.html
Copyright © 2011-2022 走看看