#刷题交流#
今日刷题交流:相邻重复字母删除问题?豆包给了很关键的步骤提示:
1.初始化栈:stack = []
2.遍历字符串:for char in s:
3.检查栈顶元素:if stack and stack[-1] == char:
4.弹出栈顶元素:stack.pop()
5.压入当前字符:stack.append(char)
6.拼接栈中字符:return ''.join(stack)
提示信息很到位,越来越好了[鼓掌]
展开
评论