class Member: def _-init-(self, self.name = name self.sponsor = sponsor self.ass
ID: 3875359 • Letter: C
Question
class Member: def _-init-(self, self.name = name self.sponsor = sponsor self.asset = asset self.mentor = mentor self , children = [] name, sponsor, asset, mentor None): = def gather lists(list_): newlist - [] for 1 in list: new list + 1 return new list def search_helper(node, member) if node.name == member: return [node] return gather lists ([search_helperKi, member) for i in node.children]) return [) elif node.children: else: def next_arrest (node, arrest_list): child None childasset = e if node.children is not []: for i in node.children: if i.asset childasset and i.name not in arrest_list: childasset i.asset child 1Explanation / Answer
i don't think it's a good idea.
if you required so instead of converting manually you can try jython, i tried to convert this but got frustraded in first hour for the proof following is the conversation ;)
package chegg;
import java.util.ArrayList;
import java.util.List;
public class Member {
private String name;
private String sponsor;
private int asset;
private String mentor;
private List<Member> children;
public Member(String name, String sponsor, int asset, String mentor, List<Member> children) {
super();
this.name = name;
this.sponsor = sponsor;
this.asset = asset;
this.mentor = mentor;
this.children = children;
}
List<String> gatherLists(List<String> list) {
return new ArrayList<String>(list);
}
Member searchHelper(Member node, String name) {
if (node.name == name)
return node;
else {
for (Member m : node.children) {
if (m.name.equals(name))
return node;
}
}
return null;
}
List<Member> newArrest(Member node, List<String> arrestList) {
if (!node.children.isEmpty()) {
List<Member> lst = new ArrayList<>();
for (Member m : node.children) {
for (String arrest : arrestList) {
if (m.name.equals(arrest))
lst.add(m);
}
}
return lst;
}
return null;
}
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.