CSC148H1 Study Guide - Midterm Guide: Linked List, Boolean Function, Docstring
1
CSC148H1 Full Course Notes
Verified Note
1 document
Document Summary
Read the docstring below for method remove rst satis er. Linkedlistnode methods provided are those in the api. def remove_first_satisfier(self, predicate): Remove first node whose value satisfies (returns true for) predicate. If there is no such node, leave self as is. 3 -> 7 ->| previous_node, current_node = none, self. front while current_node is not none and not predicate(current_node. value): previous_node = current_node current_node = current_node. next_ if current_node is not none: # current_node. value satisfies predicate if previous_node is none: # current_node was front self. front = current_node. next_ else: # previous_node is a linkedlistnode previous_node. next_ = current_node. next_ if self. back is current_node: self. back = previous_node. Read the docstring for function count lists below, and then implement it. def count_lists(list_): Return the number of lists, including list_ itself, contained in list_. @param list list_: list to count lists in. 3 return 1 + sum([count_lists(c) if isinstance(c, list) else 0 for c in list_])
