class Solution(object):
def wordPattern(self, pattern, str):
"""
:type pattern: str
:type str: str
:rtype: bool
"""
tag=0
tagdic={}
tagList=[]
i=0
while i<len(pattern):
if tagdic.has_key(pattern[i]):
tagList.append(tagdic.get(pattern[i]))
else:
tagdic.setdefault(pattern[i],tag)
tagList.append(tag)
tag+=1
i+=1
strList=str.split(‘ ‘)
tagdic={};tag=0;tagList2=[];i=0
while i<len(strList):
if tagdic.has_key(strList[i]):
tagList2.append(tagdic.get(strList[i]))
else:
tagdic.setdefault(strList[i],tag)
tagList2.append(tag)
tag+=1
i+=1
return tagList==tagList2
【leetcode?python】 290. Word Pattern
时间： 2024-10-03 13:40:08
【leetcode?python】 290. Word Pattern的相关文章
【leetcode?python】Sum Of Two Number
#-*- coding: UTF-8 -*- #既然不能使用加法和减法,那么就用位操作.下面以计算5+4的例子说明如何用位操作实现加法:#1. 用二进制表示两个加数,a=5=0101,b=4=0100:#2. 用and(&)操作得到所有位上的进位carry=0100;#3. 用xor(^)操作找到a和b不同的位,赋值给a,a=0001:#4. 将进位carry左移一位,赋值给b,b=1000:#5. 循环直到进位carry为0,此时得到a=1001,即最后的sum. #!!!!!!关于负数的运算
【一天一道LeetCode】#290. Word Pattern
一天一道LeetCode 本系列文章已全部上传至我的github,地址:ZeeCoder's Github 欢迎大家关注我的新浪微博,我的新浪微博 欢迎转载,转载请注明出处 (一)题目 Given a pattern and a string str, find if str follows the same pattern. Here follow means a full match, such that there is a bijection between a letter in pa
啊啊啊，真的没啥东西好写啊【leetcode】290. Word Pattern
public class Solution { public boolean wordPattern(String pattern, String str) { String[] s=str.split(" "); if(pattern.length()!=s.length) return false; for(int i=0;i<pattern.length();i++) { for(int j=0;j<i;j++) { if((pattern.charAt(i)!=pa
【leetcode?python】 58. Length of Last Word
#很简单,利用strip函数去除左右两边的空格,然后用split函数分割成列表 class Solution(object): def lengthOfLastWord(self, s): """ :type s: str :rtype: int """ if s==None:return 0 slist=s.strip().split(' ')
【leetcode?python】 19. Remove Nth Node From End of List
双指针思想:两个指针相隔n-1,每次两个指针向后一步,当后面一个指针没有后继了,前面一个指针的后继就是要删除的节点 # Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# self.val = x# self.next = None class Solution(object): def removeNthFromEnd(self,
【leetcode?python】 36. Valid Sudoku
数独规则如下:相当于一个9*9的矩阵 代码如下:#特定的九个格内1-9的个数至多为1#依次检查每行,每列,每个子九宫格是否出现重复元素,如果出现返回false,否则返回true.class Solution(object): def isValidSudoku(self, board): """ :type board: List[List[str]] :rtype: bool """
【leetcode?python】 111. Minimum Depth of Binary Tree
# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = None class Solution(object): depthList=[] def minDepth(self, root): ""&q
【leetcode?python】 203. Remove Linked List Elements
# Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# self.val = x# self.next = None class Solution(object): def removeElements(self, head, val): """ :type head: ListNode
【leetcode?python】 88. Merge Sorted Array
class Solution(object): def merge(self, nums1, m, nums2, n): """ :type nums1: List[int] :type m: int :type nums2: List[int] :type n: int :rtype: void Do not return anything, modify nums1 in-place