Skip to content

Instantly share code, notes, and snippets.

@vivekpatani
Created May 31, 2020 03:39
Show Gist options
  • Save vivekpatani/2d1a68dd8559f942c8f79d92c892341e to your computer and use it in GitHub Desktop.
Save vivekpatani/2d1a68dd8559f942c8f79d92c892341e to your computer and use it in GitHub Desktop.
Java
import java.util.HashMap;
import java.util.Map;
/*
Objective
Today, we're learning about Key-Value pair mappings using a Map or Dictionary data structure. Check out the Tutorial tab for learning materials and an instructional video!
Task
Given names and phone numbers, assemble a phone book that maps friends' names to their respective phone numbers. You will then be given an unknown number of names to query your phone book for. For each queried, print the associated entry from your phone book on a new line in the form name=phoneNumber; if an entry for is not found, print Not found instead.
Note: Your phone book should be a Dictionary/Map/HashMap data structure.
Input Format
The first line contains an integer, , denoting the number of entries in the phone book.
Each of the subsequent lines describes an entry in the form of space-separated values on a single line. The first value is a friend's name, and the second value is an -digit phone number.
After the lines of phone book entries, there are an unknown number of lines of queries. Each line (query) contains a to look up, and you must continue reading lines until there is no more input.
Note: Names consist of lowercase English alphabetic letters and are first names only.
Constraints
Output Format
On a new line for each query, print Not found if the name has no corresponding entry in the phone book; otherwise, print the full and in the format name=phoneNumber.
Sample Input
3
sam 99912222
tom 11122222
harry 12299933
sam
edward
harry
*/
class MapProblem {
static Map<String, String> contactMap;
/**
* Main method is the equivalent of a key to a car.
* @param args prototype
*/
public static void main(String[] args) {
// Initialise the contactMap
contactMap = new HashMap<>();
// Define the people and their respective telephone numbers and add them to map
contactMap.put("sam", "99912222");
contactMap.put("tom", "11122222");
contactMap.put("harry", "12299933");
// Test the function getTelephoneNumber by probing it with random values (some exist, some don't)
// sam does exist, so output for this probe should be 99912222
System.out.println(getTelephoneNumber("sam"));
// alex does not exist, so output for this probe should be "Not found"
System.out.println(getTelephoneNumber("alex"));
// harry does exist, so output should be 12299933
System.out.println(getTelephoneNumber("harry"));
}
/**
* Looksup information from the contacts map to respond with, nothing is returned if item is empty
* @param name Name of the contact person to lookup
* @return telephoneNumber Telephone Number
*/
public static String getTelephoneNumber(String name) {
// Step 1: Check if the item exists or not, if it does, return telephone number
if (contactMap.containsKey(name)) {
return contactMap.get(name);
}
// Step 2: Number was not found, return "Not found"
return "Not found";
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment