Question

Consider the two strings "doggie dish" and "Drip coffee". What letters do they have in common? That is, what is the letter intersection count for the pair of strings?

Let's look at 'd' first. The first string has 2 d's (d's occurrence count is 2), while the second has just 1 d (capitalization doesn't count) - so the intersection for the strings for d is 1. What about g? There the occurrence counts are 2 and 0, so the intersection is 0. The counts for the letter e is 1 and 2, so the intersection is just 1. In other words, the intersection for a particular letter is calculated by 1) determining the occurrence count for the letter in the first string; determining the occurrence count for the letter in the second string; and then reporting the minimum of the two counts.

For this assignment your job is to create a class that takes two strings as input (passed as parameters to the class constructor) and reports the letter intersection count in the strings for each letter. Letter case does not matter: both 'E' and 'e' count for 'e'.

Let's look at a more complete example. Suppose the strings are

"The Erie canal runs east/west in upstate NY!"
and
"The time has come, the walrus said, to speak of many things;"

For these strings the full intersection is below - and this display should be what your output looks like for this project.

Common Letter Count
a 4
b 0
c 1
d 0
e 5
f 0
g 0
h 1
i 2
j 0
k 0
l 1
m 0
n 2
o 0
p 1
q 0
r 1
s 4
t 5
u 1
v 0
w 1
x 0
y 1
z 0

That is, the entry for 'm' is 0: there are 0 m's in the first string, and 3 in the second string. Similarly, the entry for 'u' is 1: there are 2 u's in the first string, just 1 in the second string. To repeat, the value your code should produce for a letter should be the minimum of its occurrence count in the first string and its occurrence count in the second string.

Here is the driver class for this application:

import java.util.Scanner;
public class IntersectTester{
  public static void main(String[] args){
    Scanner scan = new Scanner(System.in);
    System.out.println("Enter first string");
    String s = scan.nextLine();
    System.out.println("Enter second string");
    String t = scan.nextLine();
    LetterIntersect i = new LetterIntersect(s,t);
    i.processStrings();
  } 
}   

Your job for this assignment, then, is to create a LetterIntersect class that, working with the given driver, will properly produce the indicated table. The class constructor should have two parameters - the strings to be studied. The class must also include a processStrings() method with no arguments, which processes the strings and then prints out the table of common occurrences.

Your solution must make use of one or several arrays in an essential way. Also, your LetterIntersect class should divide up the chores of the assignment systematically, and this decomposition should be reflected in the various methods that support the top-level method processStrings(). My code, for example, uses two array instance variables and has a constructor, a processStrings() method, and two additional major methods.

Helpful: watch the movie at the end of Section 7.1, which explains how to work with arrays that have indices that are naturally non-numeric (as is the case here - arrays in this project are naturally indexed a-z).

Paste your LetterIntersect code in the box below. Include no import statements (none are needed).

Answer 1

Output:

Doggie Dish Enter second string Drip Coffee Alphabet Count

Answer Here is the complete code import java.io. *; import iava.util. Scanner import ava util.*; //class LetterInterSect class LetterIntersect String strl; String strZi //constructor that takes two strings LetterIntersect (String vall,String va12) str1=val1 ; str2=val2 ; //processStrings ) display the alphabet with its occurence public void processstrings () //creating two ArrayL1st to hold alphabet occurrence Ior two strings ArrayList<Integer> 11stA=new ArrayList<Integer>() ; ArrayList<Integer> 1istB-new ArrayList<Integer //call Alphabetcount ) that return ArravList istA Alphabetcount (strl); listB-AlphabetCount (str2)

char ch1='a int small-0 //print the intersection of two strings System.out.println("Alphabet tCount" System.out.println(" for (int i-0;i<listA.size )i++) if (listA.get (i)<listB.get (i)) small listA.get (i) else small listB.get (i) System.out.println (ch1+"\t\t"+small) ch1++; //return the ArrayList for string passed to it / /count the occurrence oI every alphabet in the qiven string public ArrayList<Integer> AlphabetCount (String str) ArrayList<Integer> array-new ArrayList<Integer str-str.tolowerCase() //making the string to lower case so that 'E'-'e' int lenl-str, length ); char chl; int cnt1-0;

cntl0; //counting the occurence for (int k 0; k<lenl; k++) ch1=str. charAt (k) ; if(ch1==1) cntl++ array add (cntl); return array; 1/return the ArrayList

//driver class public class IntersectTester public static void main (String[] args) Scanner scan-new Scanner (System. in); Systemoout println ("enter stringl"); String o - scan.nexytl nte string?")- System.out println (" Enter string2") String t = scan.nextLine(); Letterintersect i = new LetterIntersect (set) ; i processstrigs)