Given a list of integers, we want to know whether it is possible to choose a subset of some of the integers, such that the integers in the subset adds up to the given sum recursively. We also want that if an integer is chosen to be in the sum, the integer next to it in the list must be skipped and not chosen to be in the sum. Do not use any loops or regular expressions. Test cases: skipSum( [2, 5, 10, 6], 12) true skipSum( [2, 5, 10, 6], 7) false skipSum([2, 5, 10, 6], 16) + false Given code: public static boolean skipSum(List list, int sum) { // call your recursive helper method return skipSumHelper (list, 0, sum); } 1. 2. 3. 4.
Given a list of integers, we want to know whether it is possible to choose a subset of some of the integers, such that the integers in the subset adds up to the given sum recursively. We also want that if an integer is chosen to be in the sum, the integer next to it in the list must be skipped and not chosen to be in the sum. Do not use any loops or regular expressions. Test cases: skipSum( [2, 5, 10, 6], 12) true skipSum( [2, 5, 10, 6], 7) false skipSum([2, 5, 10, 6], 16) + false Given code: public static boolean skipSum(List list, int sum) { // call your recursive helper method return skipSumHelper (list, 0, sum); } 1. 2. 3. 4.
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: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
private static boolean skipSumHelper(List<Integer> list, int start, int sum) {
// base case
// recursive step
}
![Given a list of integers, we want to know whether it is possible to choose a
subset of some of the integers, such that the integers in the subset adds up to
the given sum recursively.
We also want that if an integer is chosen to be in the sum, the integer next to it in
the list must be skipped and not chosen to be in the sum.
Do not use any loops or regular expressions.
Test cases:
skipSum([2, 5, 10, 6], 12)
true
skipSum([2, 5, 10, 6], 7)
false
skipSum( [2, 5, 10, 6], 16)
false
Given code:
public static boolean skipSum (List<Integer> list, int sum) {
// call your recursive helper method
return skipSumHelper (list, @, sum);
1.
2.
3.
4.
For example:
Test
Result
List<Integer> list
Arrays.asList(2, 5, 10, 6); true
int sum =
12;
System.out.println(skipSum(1list, sum));
List<Integer> list = Arrays.asList(2, 5, 10, 6); false
int sum = 7;
System.out.println(skipSum(list, sum));
List<Integer> list = Arrays.aslist(2, 5, 10, 6); false
int sum = 16;
System.out.println(skipSum(1ist, sum));](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F7933b4d7-dfbc-452b-bf78-981e959f7b6a%2F4781007e-ad7f-4eb6-8256-0980143f4524%2Fyl3hmbp_processed.png&w=3840&q=75)
Transcribed Image Text:Given a list of integers, we want to know whether it is possible to choose a
subset of some of the integers, such that the integers in the subset adds up to
the given sum recursively.
We also want that if an integer is chosen to be in the sum, the integer next to it in
the list must be skipped and not chosen to be in the sum.
Do not use any loops or regular expressions.
Test cases:
skipSum([2, 5, 10, 6], 12)
true
skipSum([2, 5, 10, 6], 7)
false
skipSum( [2, 5, 10, 6], 16)
false
Given code:
public static boolean skipSum (List<Integer> list, int sum) {
// call your recursive helper method
return skipSumHelper (list, @, sum);
1.
2.
3.
4.
For example:
Test
Result
List<Integer> list
Arrays.asList(2, 5, 10, 6); true
int sum =
12;
System.out.println(skipSum(1list, sum));
List<Integer> list = Arrays.asList(2, 5, 10, 6); false
int sum = 7;
System.out.println(skipSum(list, sum));
List<Integer> list = Arrays.aslist(2, 5, 10, 6); false
int sum = 16;
System.out.println(skipSum(1ist, sum));
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 1 images
Recommended textbooks for you
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY