当前位置:网站首页>Simulation volume leetcode [general] 1405 Longest happy string
Simulation volume leetcode [general] 1405 Longest happy string
2022-07-06 06:18:00 【Encounter simulation volume】
Summary : Simulation volume Leetcode Summary of questions
1405. The longest happy string
If the string does not contain any ‘aaa’,‘bbb’ or ‘ccc’ Such a string is used as a substring , Then the string is a 「 Happy string 」.
Here are three integers a,b ,c, Please return Any one A string that satisfies all of the following conditions s:
s Is a happy string as long as possible .
s in most Yes a Letters ‘a’、b Letters ‘b’、c Letters ‘c’ .
s It only contains ‘a’、‘b’ 、‘c’ Three letters .
If such a string does not exist s , Please return an empty string “”.
Example 1:
Input :a = 1, b = 1, c = 7
Output :“ccaccbcc”
explain :“ccbccacc” It is also a correct answer .
Example 2:
Input :a = 2, b = 2, c = 1
Output :“aabbc”
Example 3:
Input :a = 7, b = 1, c = 0
Output :“aabaa”
explain : This is the only correct answer to the test case .
Tips :
0 <= a, b, c <= 100
a + b + c > 0
source : Power button (LeetCode)
link :https://leetcode-cn.com/problems/longest-happy-string
Copyright belongs to the network . For commercial reprint, please contact the official authority , Non-commercial reprint please indicate the source .
Code :
from leetcode_python.utils import *
class Solution:
def longestDiverseString(self, a: int, b: int, c: int) -> str:
cnt = {
'a':a,'b':b,'c':c}
res = ''
while True:
_,mid,most = sorted(cnt.keys(),key=lambda x:cnt[x])
if (len(res)<2 or not res[-2]==res[-1]==most) and cnt[most]:
res+=most
cnt[most]-=1
elif cnt[mid]:
res+=mid
cnt[mid]-=1
else:
break
return res
def test(data_test):
s = Solution()
data = data_test # normal
# data = [list2node(data_test[0])] # list turn node
return s.longestDiverseString(*data)
def test_obj(data_test):
result = [None]
obj = Solution(*data_test[1][0])
for fun, data in zip(data_test[0][1::], data_test[1][1::]):
if data:
res = obj.__getattribute__(fun)(*data)
else:
res = obj.__getattribute__(fun)()
result.append(res)
return result
if __name__ == '__main__':
datas = [
[],
]
for data_test in datas:
t0 = time.time()
print('-' * 50)
print('input:', data_test)
print('output:', test(data_test))
print(f'use time:{
time.time() - t0}s')
remarks :
GitHub:https://github.com/monijuan/leetcode_python
CSDN Summary : Simulation volume Leetcode Summary of questions
You can add QQ Group communication :1092754609
leetcode_python.utils See the description on the summary page for details
First brush questions , Then generated by script blog, If there is any mistake, please leave a message , I see it will be revised ! thank you !
边栏推荐
- 模拟卷Leetcode【普通】1218. 最长定差子序列
- [postman] dynamic variable (also known as mock function)
- 【Postman】Collections-运行配置之导入数据文件
- [postman] collections - run the imported data file of the configuration
- IP day 16 VLAN MPLS configuration
- Overview of three core areas of Mathematics: algebra
- 二维码的前世今生 与 六大测试点梳理
- JWT-JSON WEB TOKEN
- 模拟卷Leetcode【普通】1447. 最简分数
- 在线问题与离线问题
猜你喜欢
Manhattan distance and Manhattan rectangle - print back font matrix
Career advancement Guide: recommended books for people in big factories
[no app push general test plan
E - food chain
MySQL之基础知识
Application du Groupe Li dans gtsam
Significance of unit testing
职场进阶指南:大厂人必看书籍推荐
G - Supermarket
sourceInsight中文乱码
随机推荐
模拟卷Leetcode【普通】1219. 黄金矿工
自定义指定路由上的Gateway过滤器工厂
Buuctf-[gxyctf2019] no dolls (xiaoyute detailed explanation)
MFC 动态创建的对话框及改变控件的大小和位置
What are the test sites for tunnel engineering?
MySQL之数据类型
Redis 核心技术与实战之 基本架构:一个键值数据库包含什么?
模拟卷Leetcode【普通】1109. 航班预订统计
win10无法操作(删除、剪切)文件
GTSAM中李群的運用
Manhattan distance and Manhattan rectangle - print back font matrix
[ram IP] introduction and experiment of ram IP core
Significance of unit testing
Pat (Grade B) 2022 summer exam
使用Nacos管理配置
Win10 cannot operate (delete, cut) files
CoordinatorLayout+NestedScrollView+RecyclerView 上拉底部显示不全
进程和线程的理解
[API interface tool] Introduction to postman interface
Isam2 and incrementalfixedlagsmooth instructions in gtsam