Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
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 pattern and a non-empty word in str. Example: 1. pattern = "abba", str = "dog cat cat dog" should return true. 2. pattern = "abba", str = "dog cat cat fish" should return false. 3. pattern = "aaaa", str = "dog cat cat dog" should return false. 4. pattern = "abba", str = "dog dog dog dog" should return false. Notes: You may assume pattern contains only lowercase letters, and str contains lowercase letters separated by a single space. The code is partially finished, and you have to use the provided parameter name. Pseudocode is not accepted. Hint: You may find the usage of HashMap helpful for solving this problem. Map map = new HashMap(); map.put('a', “apple"); // add a pair map.get('a'); // return apple map. containskey('a'); // return true map.containsValue(“banana") // false Note: Your method should start with the required name and parameters: class PatternChecker { public boolean check(String pattern, String str) { // ... } }

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 pattern and a non-empty word in str. Example: 1. pattern = "abba", str = "dog cat cat dog" should return true. 2. pattern = "abba", str = "dog cat cat fish" should return false. 3. pattern = "aaaa", str = "dog cat cat dog" should return false. 4. pattern = "abba", str = "dog dog dog dog" should return false. Notes: You may assume pattern contains only lowercase letters, and str contains lowercase letters separated by a single space. The code is partially finished, and you have to use the provided parameter name. Pseudocode is not accepted. Hint: You may find the usage of HashMap helpful for solving this problem. Map map = new HashMap(); map.put('a', “apple"); // add a pair map.get('a'); // return apple map. containskey('a'); // return true map.containsValue(“banana") // false Note: Your method should start with the required name and parameters: class PatternChecker { public boolean check(String pattern, String str) { // ... } }

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ
See similar textbooks
icon
Related questions
Question

Please answer the question in the screenshot. The language used here is Java. Please give the source code. 

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 pattern and a non-empty word in str. Example: 1. pattern = "abba", str = "dog cat cat dog" should return true. 2. pattern = "abba", str = "dog cat cat fish" should return false. 3. pattern = "aaaa", str = "dog cat cat dog" should return false. 4. pattern = "abba", str = "dog dog dog dog" should return false. Notes: You may assume pattern contains only lowercase letters, and str contains lowercase letters separated by a single space. The code is partially finished, and you have to use the provided parameter name. Pseudocode is not accepted. Hint: You may find the usage of HashMap helpful for solving this problem. Map<Character, String> map = new HashMap<Character, String>(); map.put('a', "apple"); // add a <key, val> pair map.get('a'); // return apple map. containsKey('a'); // return true map.containsvalue(“banana") // false Note: Your method should start with the required name and parameters: class PatternChecker { public boolean check(String pattern, string str) { // ... }
Transcribed Image Text: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 pattern and a non-empty word in str. Example: 1. pattern = "abba", str = "dog cat cat dog" should return true. 2. pattern = "abba", str = "dog cat cat fish" should return false. 3. pattern = "aaaa", str = "dog cat cat dog" should return false. 4. pattern = "abba", str = "dog dog dog dog" should return false. Notes: You may assume pattern contains only lowercase letters, and str contains lowercase letters separated by a single space. The code is partially finished, and you have to use the provided parameter name. Pseudocode is not accepted. Hint: You may find the usage of HashMap helpful for solving this problem. Map<Character, String> map = new HashMap<Character, String>(); map.put('a', "apple"); // add a <key, val> pair map.get('a'); // return apple map. containsKey('a'); // return true map.containsvalue(“banana") // false Note: Your method should start with the required name and parameters: class PatternChecker { public boolean check(String pattern, string str) { // ... }
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS