I just need the method they are asking for Write a recursive function that takes a start index, array of integers, and a target sum. Your goal is to find whether a subset of the array of integers adds up to the target sum. The start index is initially 0. A target sum of 0 is true for any array. Examples: subsetSum(0, {2, 4, 8}, 10) -> true public boolean subsetSum(int start, int[] nums, int target) { }
I just need the method they are asking for Write a recursive function that takes a start index, array of integers, and a target sum. Your goal is to find whether a subset of the array of integers adds up to the target sum. The start index is initially 0. A target sum of 0 is true for any array. Examples: subsetSum(0, {2, 4, 8}, 10) -> true public boolean subsetSum(int start, int[] nums, int target) { }
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
I just need the method they are asking for
Write a recursive function that takes a start index, array of integers, and a target sum. Your goal is to find whether a subset of the array of integers adds up to the target sum. The start index is initially 0.
A target sum of 0 is true for any array.
Examples: subsetSum(0, {2, 4, 8}, 10) -> true
public boolean subsetSum(int start, int[] nums, int target) {
}
Expert Solution
Step 1 : Code (Explained with comment)
public class Main {
public boolean subsetSum(int start, int[] nums, int target) {
if (target == 0) { // base case
return true;
}
if (start >= nums.length) { // base case
return false;
}
// recursive case
return subsetSum(start + 1, nums, target - nums[start]) // include nums[start]
|| subsetSum(start + 1, nums, target); // exclude nums[start]
}
public static void main(String[] args) {
Main m = new Main();
int[] nums = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
System.out.println(m.subsetSum(0, nums, 10));
System.out.println(m.subsetSum(0, nums, 11));
System.out.println(m.subsetSum(0, nums, 12));
System.out.println(m.subsetSum(0, nums, 56));
}
}
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 2 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education