Re: [閒聊] 每日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.
EX:
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 = "aa", s = "dog"
Output: false
C# CODE:
https://i.imgur.com/8TYOxB5.png
--
(づ′・ω・）づ
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 118.241.148.89 (日本)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1672541390.A.A31.html
討論串 (同標題文章)
完整討論串 (本文為第 170 之 719 篇)：