Write a method countCommon that accepts two lists of integers as parameters and returns the number of unique integers that occur in both lists. Use one or more sets as storage to help you solve this problem. For example, if one list contains the values [3, 7, 3, –1, 2, 3, 7, 2, 15, 15] and the other list contains the values [–5, 15, 2, –1, 7, 15, 36], your method should return 4 because the elements –1, 2, 7, and 15 occur in both lists. Your method should return correct result with different lists as well. 2. Write a method maxLength that accepts a set of strings as a parameter and that returns the length of the longest string in the list. If your method is passed an empty set, it should return 0.In your project COSC241_, create Lab4_yourusername.java and declare proper lists and sets to call the two methods countCommon and maxLength. And your output should show the two methods work as expected.Make sure you have comments through your program.
1. Write a method countCommon that accepts two lists of integers as parameters and returns the number of unique integers that occur in both lists. Use one or more sets as storage to help you solve this problem. For example, if one list contains the values [3, 7, 3, –1, 2, 3, 7, 2, 15, 15] and the other list contains the values [–5, 15, 2, –1, 7, 15, 36], your method should return 4 because the elements –1, 2, 7, and 15 occur in both lists. Your method should return correct result with different lists as well.
2. Write a method maxLength that accepts a set of strings as a parameter and that returns the length of the longest string in the list. If your method is passed an empty set, it should return 0.In your project COSC241<Lab4>_<your username>, create Lab4_yourusername.java and declare proper lists and sets to call the two methods countCommon and maxLength. And your output should show the two methods work as expected.Make sure you have comments through your
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
