高分求字符串比较的解决原代码——100分
两个由英文句子组成的字符串S和D,其中D为目标串,拿S与D比较,要求:
1、两个串按英语单词进行比较,忽略单词间多余的空格,且单词区分大小写!
例:
D:='Good Morning!' S:='Good Morning! '
则 S=D 成立!
2、若串S掉了n个单词,则在相应掉词的位置插入'{n}'。
例:
D:='Convenient to wineries, hiking trails, State Parks and Sugar Loaf Observatory. Award winning income producing vineyard.'
S:=Convenient to wineries, hiking trails, State Loaf Observatory. Award winning producing vineyard.'
则结果S应为:
'Convenient to wineries, hiking trails, State {3} Loaf Observatory. Award winning {1} producing vineyard.'
3、若S中错了一个单词,则将错误的单词用括号‘()’括起来。
例:D:='Convenient to wineries, hiking trails, State Parks and Sugar Loaf Observatory. Award winning income producing vineyard.'
S:='Convenient to wineries, hiking trail, State Parks and Sugar Loaf Observatory. Award win income producing vineyard.'
则结果S应为:
'Convenient to wineries, hiking (trail), State Parks and Sugar Loaf Observatory. Award (win) income producing vineyard.'
4、若S中多了单词,则将多余的单词用[]括起来!
例:D:='Located in private mountain community of Yosemite Lakes Park.'
S:='Located in the private mountain community of Yosemite Lakes Park.'
则:S应为:
‘Located in [the] private mountain community of Yosemite Lakes Park.’
5、标点符号的错误处理与上基本相同(将一个标点视为一个单词),处理时将正确答案结出。
例: D:='Good Morning!'
S:='Good Morning.'
则:结果S应为 'Good Morning!(.)' 应为‘!’,而不是'.'。
例: D:='wineries, hiking trails, State'
S:='wineries hiking trails State'
则结果S应为:' wineries,{} hiking trails,{} State'
例:D:='wineries hiking trails, State'
S:='wineries, hiking trails, State'
则结果为:'wineries[,] hiking trails, State'
请结出处理的原代码,分不够再加!!!!!
1、两个串按英语单词进行比较,忽略单词间多余的空格,且单词区分大小写!
例:
D:='Good Morning!' S:='Good Morning! '
则 S=D 成立!
2、若串S掉了n个单词,则在相应掉词的位置插入'{n}'。
例:
D:='Convenient to wineries, hiking trails, State Parks and Sugar Loaf Observatory. Award winning income producing vineyard.'
S:=Convenient to wineries, hiking trails, State Loaf Observatory. Award winning producing vineyard.'
则结果S应为:
'Convenient to wineries, hiking trails, State {3} Loaf Observatory. Award winning {1} producing vineyard.'
3、若S中错了一个单词,则将错误的单词用括号‘()’括起来。
例:D:='Convenient to wineries, hiking trails, State Parks and Sugar Loaf Observatory. Award winning income producing vineyard.'
S:='Convenient to wineries, hiking trail, State Parks and Sugar Loaf Observatory. Award win income producing vineyard.'
则结果S应为:
'Convenient to wineries, hiking (trail), State Parks and Sugar Loaf Observatory. Award (win) income producing vineyard.'
4、若S中多了单词,则将多余的单词用[]括起来!
例:D:='Located in private mountain community of Yosemite Lakes Park.'
S:='Located in the private mountain community of Yosemite Lakes Park.'
则:S应为:
‘Located in [the] private mountain community of Yosemite Lakes Park.’
5、标点符号的错误处理与上基本相同(将一个标点视为一个单词),处理时将正确答案结出。
例: D:='Good Morning!'
S:='Good Morning.'
则:结果S应为 'Good Morning!(.)' 应为‘!’,而不是'.'。
例: D:='wineries, hiking trails, State'
S:='wineries hiking trails State'
则结果S应为:' wineries,{} hiking trails,{} State'
例:D:='wineries hiking trails, State'
S:='wineries, hiking trails, State'
则结果为:'wineries[,] hiking trails, State'
请结出处理的原代码,分不够再加!!!!!
...全文
相关推荐
统计一组字符串中字母,数字,空格的个数(C语言原代码
统计一组字符串中字母,数字,空格的个数(C语言原代码
【华为OD机试真题 C语言】60、翻牌求最大分 | 机试真题+思路参考+代码解析
给出n个牌数,在-10到100之间,求最大得分。 > 规则如下:连续翻牌,如果选当前牌,则总得分等于上一次翻牌总得分加上当前牌的数字 > 如果当前总得分小于它前三次的总得分的话,那此次不翻牌,并且总得分就等于它前三次的得分。 > 1到3次翻牌数如果小于0的话就取0。 > 例子:1,-5,-6,4,7,2,-2 (1) 1大于零翻牌 (2) -5加上1忏0不翻结果为0 (3) -6 加上0小于0不翻结果为0 (4) 4加上0大于0 (1) 翻牌结果
字符串相似度比较算法
字符串相似度比较算法,可比较不同长度的任意两个字符串的相似度,以百分比显示。
字符串相似度比较
这个demo运行起来要注意,字符串数量不能太大,不然会发生内存泄漏
汇编程序比较字符串
比较两个字符串,字符串由键盘输入得到,相同输出‘match',不同输出'no match'并作循环控制


语言基础/算法/系统设计
