Description
A transaction is possibly invalid if:
- the amount exceeds $1000, or;
- if it occurs within (and including) 60 minutes of another transaction with the same name in a different city.
Each transaction string transactions[i] consists of comma separated values representing the name, time (in minutes), amount, and city of the transaction.
Given a list of transactions, return a list of transactions that are possibly invalid. You may return the answer in any order.
Example 1:
Input: transactions = ["alice,20,800,mtv","alice,50,100,beijing"]
Output: ["alice,20,800,mtv","alice,50,100,beijing"]
Explanation: The first transaction is invalid because the second transaction occurs within a difference of 60 minutes, have the same name and is in a different city. Similarly the second one is invalid too.
Example 2:
Input: transactions = ["alice,20,800,mtv","alice,50,1200,mtv"]
Output: ["alice,50,1200,mtv"]
Example 3:
Input: transactions = ["alice,20,800,mtv","bob,50,1200,mtv"]
Output: ["bob,50,1200,mtv"]
Constraints:
- transactions.length <= 1000.
- Each transactions[i] takes the form “{name},{time},{amount},{city}”
- Each {name} and {city} consist of lowercase English letters, and have lengths between 1 and 10.
- Each {time} consist of digits, and represent an integer between 0 and 1000.
- Each {amount} consist of digits, and represent an integer between 0 and 2000.
分析
题目的意思是:给定一个字符串数组,要求找出满足上述两个条件的字符串。我一开始暴力破解了一下,发现当前的字符串不止跟前一个字符串有关,还可能与其他字符串有关,所以我当时只把前一个字符串考虑进来,所以有点问题。后面参考了别人的实现,也算是暴力破解出来了,代码是我自己写的,只参考了一下思路,保持了一下原创哈哈哈
代码
class Solution:
def invalidTransactions(self, transactions: List[str]) -> List[str]:
res=[]
for i,t1 in enumerate(transactions):
item=t1.split(',')
val=int(item[2])
minute=int(item[1])
name=item[0]
city=item[-1]
if(val>1000):
res.append(t1)
continue
for j,t2 in enumerate(transactions):
if(i!=j):
item=t2.split(',')
val2=int(item[2])
minute2=int(item[1])
name2=item[0]
city2=item[-1]
if(abs(minute2-minute)<=60 and name2==name and city2!=city):
res.append(t1)
break
return res