面试题10：Vasya - Clerk

最新推荐文章于 2019-11-16 09:45:09 发布

舒碧虎

最新推荐文章于 2019-11-16 09:45:09 发布

阅读量453

点赞数

分类专栏：面试

本文链接：https://blog.csdn.net/qq_32801733/article/details/78091478

版权

面试专栏收录该内容

15 篇文章

订阅专栏

本文讨论了一道面试题目，涉及电影院售票场景。题目中，Vasya作为售票员，需要使用顾客支付的100、50或25美元面额的钞票来售卖25美元一张的电影票，并给予正确找零。问题在于Vasya初始没有资金且必须按顾客排队顺序售票。解题关键是判断Vasya是否能为每位顾客完成交易。文章列举了多种解题思路和解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

The new “Avengers” movie has just been released! There are a lot of people at the cinema box office standing in a huge line. Each of them has a single 100, 50 or 25 dollars bill. A “Avengers” ticket costs 25 dollars.
*Vasya is currently working as a clerk. He wants to sell a ticket to every single person in this line.
Can Vasya sell a ticket to each person and give the change if he initially has no money and sells the tickets strictly in the order people follow in the line?
Return YES, if Vasya can sell a ticket to each person and give the change. Otherwise return NO.*

Line.Tickets(new int[] {25, 25, 50}) // => YES
Line.Tickets(new int []{25, 100})
// => NO. Vasya will not have enough money to give change to 100 dollars

解法一：

public class Line {
    public static String Tickets(int[] peopleInLine) {
     Map<String,Integer> map = new HashMap<String,Integer>();
     map.put("25" , 0); 
     map.put("50" , 0);
     map.put("100" , 0);
    for (int i : peopleInLine){
      if (25 == i){
        map.put("25" , map.get("25")+1);
      }
      if (50 == i){
        map.put("50" , map.get("50")+1);
      }
      if (100 == i){
        map.put("100" , map.get("100")+1);
      }
    }
    for(int i : peopleInLine){
      if (25 == i){
        map.put("25" , map.get("25")+1);
      }
      if (50 == i){
        if(map.get("25")>=1){
          map.put("50" , map.get("50")+1);
          map.put("25" , map.get("25")-1);
        }else{
         return "NO";
        }
      }
      if (100 == i){
         boolean flagOne = map.get("25") >=3;
         boolean flagTwo = map.get("50") >= 1 && map.get("25") >= 1;
       if (flagOne || flagTwo){
         if (flagTwo){
           map.put("50", map.get("50")-1);
           map.put("25", map.get("25")-1);
         } 
         if (flagOne){
             map.put("25", map.get("25")-3);
         }
       }
       else {
         return "NO";
      }
    };
   }
    return "YES";
}
     @Test
        public void test1() {
          assertEquals("YES", Line.Tickets(new int[] {25, 25, 50}));
        }
       @Test
       public void test2() {
          assertEquals("NO", Line.Tickets(new int []{25, 100}));
        }
}

解法二：

public class Line {
  public static String Tickets(int[] peopleInLine)
  {
        int a = 0;
        int b = 0;

        for (int i = 0; i < peopleInLine.length; i++) {
            if (peopleInLine[i] == 25){
                a++;
            }else if (peopleInLine[i] == 50 && a > 0){
                b++;
                a--;
            }else if (peopleInLine[i] == 100 && a > 0 && b >0){
                a--;
                b--;
            }else if (peopleInLine[i] == 100 && a >= 3){
                a-=3;
            }else {
                return "NO";
            }
        }

        return "YES";
    }

}

解法三：

public class Line {
    public static String Tickets(int[] peopleInLine){
        int bill25 = 0, bill50 = 0;
        for (int payment : peopleInLine){
            if(payment==25){
                bill25++;
            } else if(payment==50){
                bill25--;
                bill50++;
            } else if(payment==100){
                if(bill50>0){
                    bill50--;
                    bill25--;
                } else{
                    bill25-=3;
                }
            }
            if(bill25<0 || bill50 <0){
                return "NO";
            }
        }
        return "YES";
    }
}

解法四：

public class Line {
  public static String Tickets(int[] peopleInLine)
  {
      int i, sum=0, change = 0;
      String a = "";
      for(i=0; i<peopleInLine.length; i++) {

          sum += 25;
          change = (peopleInLine[i] - 25);
          sum -= change;

          if(sum < change) {
            a = "NO";
          }
          else a = "YES";
      }
      return a;
  }
}