Codewars Vasya - Clerk--6 kyu--Python解法

Codewars Vasya - Clerk–6 kyu–Python解法

Codewars 是一个跟LeetCode类似的结题网站。
Codewars题解专栏：Codewars题解

题目地址：Train: Vasya - Clerk | Codewars

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 dollar bill. An “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 every person and give change if he initially has no money and sells the tickets strictly in the order people queue?

Return YES, if Vasya can sell a ticket to every person and give change with the bills he has at hand at that moment. Otherwise return NO.

Examples:

tickets([25, 25, 50]) # => YES
tickets([25, 100]) # => NO. Vasya will not have enough money to give change to 100 dollars
tickets([25, 25, 50, 50, 100]) # => NO. Vasya will not have the right bills to give 75 dollars of change (you can't make two bills of 25 from one of 50)

这道题目是6kyu难度的，比较简单。
Python解法如下：

def tickets(people):l=[0,0]for i in people:if i==25:l[0]+=1elif i==50:if l[0]==0:return "NO"else:l[0]-=1l[1]+=1else:if l[1]>=1:if l[0]==0:return "NO"else:l[0]-=1l[1]-=1else:if l[0]<3:return "NO"else:l[0]-=3return "YES"

上面的解法是比较啰嗦的，简化后别人的解法参考如下：

def tickets(a):n25 = n50 = n100 = 0for e in a:if   e==25            : n25+=1elif e==50            : n25-=1; n50+=1elif e==100 and n50>0 : n25-=1; n50-=1elif e==100 and n50==0: n25-=3if n25<0 or n50<0:return 'NO'return 'YES'

Codewars Vasya - Clerk--6 kyu--Python解法相关推荐

LeetCode 111. Minimum Depth of Binary Tree--Java, Python解法--二叉树最小高度--迭代，递归
题目地址:Minimum Depth of Binary Tree - LeetCode Given a binary tree, find its minimum depth. The minimu ...
LeetCode 226. Invert Binary Tree--反转二叉树--C++,Python解法--递归，迭代做法
题目地址:Invert Binary Tree - LeetCode Invert a binary tree. Example: Input: 4/ \2 7/ \ / \ 1 3 6 9 Outp ...
LeetCode 204. Count Primes--从一开始的质数个数--Python解法--面试算法题
题目地址:Count Primes - LeetCode Count the number of prime numbers less than a non-negative number, n. E ...
LeetCode 458. Poor Pigs--智力题「小白鼠试毒」--C++,Python解法
题目地址:Poor Pigs - LeetCode There are 1000 buckets, one and only one of them is poisonous, while the r ...
LeetCode 230. Kth Smallest Element in a BST--C++,Python解法--面试真题--找二叉树中第K小的元素
题目地址:Kth Smallest Element in a BST - LeetCode Given a binary search tree, write a function kthSmalle ...
LeetCode 221. Maximal Square----动态规划--谷歌面试算法题--Python解法
题目地址:Maximal Square - LeetCode Given a 2D binary matrix filled with 0's and 1's, find the largest sq ...
LeetCode 148. Sort List--面试算法题--C++,Python解法
LeetCode 148. Sort List–面试算法题–C++,Python解法 LeetCode题解专栏:LeetCode题解 LeetCode 所有题目总结:LeetCode 所有题目总结大 ...
LeetCode 20. Valid Parentheses--笔试题--Python解法
题目地址:Valid Parentheses - LeetCode Given a string containing just the characters '(', ')', '{', '}', ...
LeetCode 145. Binary Tree Postorder Traversal--后序遍历--先序遍历反向输出--递归，迭代--C++,Python解法
题目地址:Binary Tree Postorder Traversal - LeetCode Given a binary tree, return the postorder traversal ...

Codewars Vasya - Clerk--6 kyu--Python解法

Codewars Vasya - Clerk--6 kyu--Python解法相关推荐

最新文章

热门文章