Question

ASSIGNMENT INFO Lab 10 Lab 10 / 1. Problem 1 saved 3 points possible Reset to Starter Code Due in 2h 29m Instructions Start Here Question 1 Saved Coding Problem, 3 points possible Write a program that has a static method called shares that takes in two arraylists and returns a new arraylist that contains the words that are common to both arraylists - do not include duplicates! Write this as a static method in the same program as your main method - no need to worrying about classes with this question. Question 2 Coding Problem, 3 points possible In your main method, create two arraylists of Strings. Read in the strings for the first arraylist on the first line (the String-1" will indicate that there are no more Strings to add). Then read in string for the second arraylist on the second line. Again string "-1" indicates that there are no more strings to add. Print both arraylists (first list followed by second list). Then call the method shares and print out the returned arraylist. You may assume that the strings are entered as words separated by a space on a single line and the end is signaled by"-1" (String-1). You can use next() to read each word. Question 3 Coding Problem, 4 points possible Hint: The method header for the method shares would be: public static ArrayList<String> shares (ArrayList<String>list), ArrayList<String>list2) Then start by going through the elements in list 1; if the item also exists in list2, then add to the third list (but make sure to not add duplicates) Review & Submit 2 questions remaining Remember - you need to import ArrayList (import java.util.ArrayList:] Input java c pascal ada java c++ -1 c pascal java lisp lisp -1 Output [java, c, pascal, ada, java, C++] [c, pascal, java, lisp, lisp] [java, c, pascal] v Grading 12 Problem1.java Run Tests 1 Full Screen New 1 Test Case 1 FAILED 0/ 1 pts - Click for details e Test Case 2 Test case is hidden HIDDEN Test Case 3 HIDDEN Test case is hidden Collapse Sidebar

Answer 1

CODE:

import java.util.*;
public class lab {
   public static void main(String[] args)
   {
       Scanner input=new Scanner(System.in);
       ArrayList<String> list1=new ArrayList<>();
       ArrayList<String> list2=new ArrayList<>();
       String str=input.next();//reading first list
       while(!str.equals("-1"))
       {
           list1.add(str);
           str=input.next();
       }
       str=input.next();//reading second list
       while(!str.equals("-1"))
       {
           list2.add(str);
           str=input.next();
       }
       ArrayList<String> newlist=shares(list1, list2); //newlist
       System.out.println(newlist.toString()); //printing new lsit
          
      
      
      
   }
   public static ArrayList<String> shares(ArrayList<String> list1,ArrayList<String> list2)
   {
       ArrayList<String> newlist=new ArrayList<>();
       for(int i=0;i<list1.size();i++) //iterating through list 1
       {
           //checking if string existing in both list1 and list2 and not in newlist
           if(list2.contains(list1.get(i)) && !newlist.contains(list1.get(i)))
           {
               newlist.add(list1.get(i));
           }
          
       }
       for(int i=0;i<list2.size();i++)
       {
           //checking if string existing in both list1 and list2 and not in newlist
           if(list1.contains(list2.get(i)) && !newlist.contains(list2.get(i)))
           {
               newlist.add(list1.get(i));
           }
          
       }
       return newlist;//returning newlist
   }

}

OUTPUT:

java c pascal ada java C++ -1 c pascal java lisp lisp -1 [ java, c, pascal]

Please rate my answer if you liked it.