Given an input string, reverse the string word by word.
来源:互联网 发布:中国制造2025 知乎 编辑:程序博客网 时间:2024/05/17 07:38
题目:Given an input string, reverse the string word by word.
For example,
Given s = "the sky is blue",
return "blue is sky the".
思路:用栈实现,利用两个栈stackWord,stackSentence,一个存单词,一个存句子,遇到“ ”之前将字符存于stackWord中,当遇到“ ”后,将stackWord中的字符出栈进入stackSentence中,最后直接出栈stackSentence中的句子就行了。
代码:
from Stack import Stack1
A=input('请输入句子:')
stackWord=Stack1(A)
stackSentence=Stack1(A)
for i in range(len(A)):
if i==len(A) or A[i]==' ':
if not stackWord.isempty():
if not stackSentence.isempty():
stackSentence.push(" ")
while not stackWord.isempty():
stackSentence.push(stackWord.pop())
else:stackWord.push(A[i])
i+=1
while not stackSentence.isempty():
print(stackSentence.pop())
For example,
Given s = "the sky is blue",
return "blue is sky the".
思路:用栈实现,利用两个栈stackWord,stackSentence,一个存单词,一个存句子,遇到“ ”之前将字符存于stackWord中,当遇到“ ”后,将stackWord中的字符出栈进入stackSentence中,最后直接出栈stackSentence中的句子就行了。
代码:
from Stack import Stack1
A=input('请输入句子:')
stackWord=Stack1(A)
stackSentence=Stack1(A)
for i in range(len(A)):
if i==len(A) or A[i]==' ':
if not stackWord.isempty():
if not stackSentence.isempty():
stackSentence.push(" ")
while not stackWord.isempty():
stackSentence.push(stackWord.pop())
else:stackWord.push(A[i])
i+=1
while not stackSentence.isempty():
print(stackSentence.pop())
实现:
0 0
- Given an input string, reverse the string word by word.
- Given an input string, reverse the string word by word.
- Reverse String and Word
- Reverse an input character string
- Reverse Word in a String
- Leetcode: Reverse word in string
- reverse word in a string(leetcode)
- Reverse Word in a String(improve)
- Reverse word in a string [leetcode]
- Reverse every word in a String
- 【Leetcode】Reverse word in a string
- find the longest numeric string in the given input strings
- reverse a given string StringTokenizer
- Find the Longest Word in a String
- reverse the String
- reverse the string
- freecodecamp学习--Find the Longest Word in a String
- java中将word转String
- 通向架构师的道路(第十八天)万能框架Spring(一)
- 浮点数比较
- www.idcnd.net提供
- 使用行为树(Behavior Tree)实现游戏AI
- “三天打渔,两天晒网”程序说明(算法流程图)及调试与测试结果
- Given an input string, reverse the string word by word.
- Maven简单配置
- 华为Java编程规范
- 各类硬盘对比
- RTP时间戳
- flume1.7.0-taildirSource 支持多文件监控和断点续传
- CSRF学习笔记之CSRF的攻击与防御以及审计【00x1 】
- linux命令大全
- 【LeetCode 539】 Minimum Time Difference