🥉

Word Pattern

Created

2022/01/17 02:43

문제 번호

290

카테고리

Hash Table

String

Word Pattern - LeetCode

Given a pattern and a string s, find if s follows the same pattern. Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in s.

https://leetcode.com/problems/word-pattern/

Code

제출 날짜	시간	메모리
2021/01/17	0 ms	2 MB

// 290. Word Pattern
//
// https://leetcode.com/problems/word-pattern/

// strings package has been imported to call Split function.
import (
	"strings"
)

// wordPattern function checks the given string has the exact form of the given pattern.
// The given string is splitted by strings.Split function.
// To check the pattern a : x, matching hash map has been used.
// To chekc the duplication of word like a : x & b : x, wordMap has map has been used.
func wordPattern(pattern string, s string) bool {
	matching := make(map[byte]string)
	wordMap := make(map[string]byte)
	words := strings.Split(s, " ")
	if len(pattern) != len(words) {
		return false
	}
	for i := 0; i < len(pattern); i++ {
		ch, word := pattern[i], words[i]
		if val, ok := matching[ch]; ok {
			if val != word {
				return false
			}
		} else {
			matching[ch] = word
		}
		if val, ok := wordMap[word]; ok {
			if val != ch {
				return false
			}
		} else {
			wordMap[word] = ch
		}
	}
	return true
}
Go
복사