leetcode之Word Pattern
来源:互联网 发布:初学c语言看什么书好 编辑:程序博客网 时间:2024/04/27 17:56
这道题是要求把字母换成一个字符串之后,比较2者是否相等。注意在替换的过程中直接在原字符串上替换有可能导致前面替换的对后面产生影响,且2个不同的字母的替换不能相同。代码如下:
class Solution(object): def wordPattern(self, pattern, str): """ :type pattern: str :type str: str :rtype: bool """ q = list(pattern) p = set(q) c = [] str1 = str.split(' ') compare = '' # print str1 for i in p: a = pattern.index(i) if a > len(str1) -1: return False b = str1[a] if b == compare: return False for j in range(len(q)): if j not in c: if q[j] == i: q[j] = b c.append(j) compare = b if q == str1: return True else: return False
0 0
- leetcode之Word Pattern
- leetcode之Word Pattern
- leetcode | Word Pattern
- 【leetcode】290. Word Pattern
- leetcode 290: Word Pattern
- [Leetcode]Word Pattern
- [leetcode 290]Word Pattern
- LeetCode 290 Word Pattern
- 【leetcode】290. Word Pattern
- [LeetCode 290] Word Pattern
- leetcode 290 Word Pattern
- LeetCode 2 Word Pattern
- leetcode word-pattern
- leetcode: Word Pattern
- leetcode:Word Pattern
- [Leetcode]Word Pattern
- LeetCode Word Pattern
- LeetCode-Word Pattern
- Unity Internal Compiler Error 报错拾遗
- 电池厂家
- 怎么在Eclipse上运行静态网页
- 游戏开发Camera之Cinematic Camera-深度
- webview隐藏滚动条
- leetcode之Word Pattern
- 康大亮Objective-C全部语法整理
- HTML语言基础
- MVC框架之jsp总结
- JavaBean List Map Json的转化
- 求二叉树叶子节点的最浅深度
- Android-IOS移动开发技术-1:XMPP JID 和通信原语有3种:message、presence和IQ
- TCP/IP详解 卷1 笔记 第9章 IP选路
- AndroidManifest详解之Application(有图更好懂)