recurDescents（p）和recurAncestors（p）

Question

我需要編寫一個帶有兩個函數的Python腳本。一個功能是將（p）的後代孩子還給Take（p）並返回（p）的祖先。

我做了一個腳本，返回（p）的子項。

parent = [("Homer","Bart"),("Homer","Lisa"),("Abe","Homer"),("Bart","Jim"),("Jim","Kim"),("Lisa","Lora")] 

def child(p): #definition of child function() 
    result = []  
    for x in parent: 
     if x[0] == p: 
      print(x[1]) 
      result.append(x[1]) 


     return result 

def grandChild (p): 
    result = [] 
    children = child(p) 
    for x in children: 
     for y in parent: 
      if x == y[0]: 
       result.append(y(1)) 
      return result 



p = "Homer" 
children = child(p) # my caller question 
print(p, " has child ", children) 

我只是不知道該怎麼做。

Answer 1

您的退貨聲明位於錯誤的地方。他們應該是環外：

def f(): 
    for loop 
     stuff 
    return ... 

如果你想有一個稍微更簡潔的版本：

#find children of parent p 
[child for parent, child in list_of_parents if parent == p] 
#find parent of child c 
[parent for parent, child in list_of_parents if child == c]