-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy path0290-word-pattern.rb
68 lines (57 loc) · 1.59 KB
/
0290-word-pattern.rb
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
# frozen_string_literal: true
# 290. Word Pattern
# https://leetcode.com/problems/word-pattern
# Easy
=begin
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.
Example 1:
Input: pattern = "abba", s = "dog cat cat dog"
Output: true
Example 2:
Input: pattern = "abba", s = "dog cat cat fish"
Output: false
Example 3:
Input: pattern = "aaaa", s = "dog cat cat dog"
Output: false
Constraints:
1 <= pattern.length <= 300
pattern contains only lower-case English letters.
1 <= s.length <= 3000
s contains only lowercase English letters and spaces ' '.
s does not contain any leading or trailing spaces.
All the words in s are separated by a single space.
=end
# @param {String} pattern
# @param {String} s
# @return {Boolean}
def word_pattern(pattern, s)
p1 = pattern.chars
p2 = s.split " "
return false if p1.size != p2.size
hmap = {}
p1.each_with_index do |c, idx|
ptr = "pat_#{c}"
st = "word_#{p2[idx]}"
if hmap[ptr].nil? && hmap[st].nil?
hmap[ptr] = idx
hmap[st] = idx
elsif !hmap[ptr].nil? && !hmap[st].nil? && hmap[ptr] == hmap[st]
next
else
return false
end
end
true
end
# **************** #
# TEST #
# **************** #
require "test/unit"
class Test_word_pattern < Test::Unit::TestCase
def test_
assert_equal true, word_pattern("abba", "dog cat cat dog")
assert_equal false, word_pattern("abba", "dog cat cat fish")
assert_equal false, word_pattern("aaaa", "dog cat cat dog")
end
end