Програмиране с Python

Курс във Факултета по Математика и Информатика към СУ

Решение на Родословно дърво от Мартина Величкова

Обратно към всички решения

Към профила на Мартина Величкова

Резултати

  • 6 точки от тестове
  • 0 бонус точки
  • 6 точки общо
  • 11 успешни тест(а)
  • 0 неуспешни тест(а)

Код

class Person:
def __init__(self, name, gender, birth_year, father=None, mother=None):
self.name = name
self.gender = gender
self.birth_year = birth_year
self.father = father
self.children_list = []
if father:
father.set_child(self)
self.mother = mother
if mother:
mother.set_child(self)
def get_brothers(self):
brothers_from_mother = self.__get_parents_children(self.mother, 'M')
brothers_from_father = self.__get_parents_children(self.father, 'M')
brothers = set(brothers_from_mother + brothers_from_father)
if self in brothers:
brothers.remove(self)
return list(brothers)
def get_sisters(self):
sisters_from_mother = self.__get_parents_children(self.mother, 'F')
sisters_from_father = self.__get_parents_children(self.father, 'F')
sisters = set(sisters_from_mother + sisters_from_father)
if self in sisters:
sisters.remove(self)
return list(sisters)
def children(self, gender='M/F'):
if gender == 'M/F':
return self.children_list
else:
return [child for child in self.children_list
if child.gender == gender]
def set_child(self, child):
self.children_list.append(child)
def is_direct_successor(self, child):
if child in self.children_list:
return True
else:
return False
def gender(self):
return self.gender
def __get_parents_children(self, parent, gender):
if parent:
return parent.children(gender)
else:
return []

Лог от изпълнението

...........
----------------------------------------------------------------------
Ran 11 tests in 0.006s

OK

История (1 версия и 0 коментара)

Мартина обнови решението на 31.03.2013 16:10 (преди над 11 години)

+class Person:
+
+ def __init__(self, name, gender, birth_year, father=None, mother=None):
+ self.name = name
+ self.gender = gender
+ self.birth_year = birth_year
+ self.father = father
+ self.children_list = []
+ if father:
+ father.set_child(self)
+ self.mother = mother
+ if mother:
+ mother.set_child(self)
+
+ def get_brothers(self):
+ brothers_from_mother = self.__get_parents_children(self.mother, 'M')
+ brothers_from_father = self.__get_parents_children(self.father, 'M')
+ brothers = set(brothers_from_mother + brothers_from_father)
+ if self in brothers:
+ brothers.remove(self)
+ return list(brothers)
+
+ def get_sisters(self):
+ sisters_from_mother = self.__get_parents_children(self.mother, 'F')
+ sisters_from_father = self.__get_parents_children(self.father, 'F')
+ sisters = set(sisters_from_mother + sisters_from_father)
+ if self in sisters:
+ sisters.remove(self)
+ return list(sisters)
+
+ def children(self, gender='M/F'):
+ if gender == 'M/F':
+ return self.children_list
+ else:
+ return [child for child in self.children_list
+ if child.gender == gender]
+
+ def set_child(self, child):
+ self.children_list.append(child)
+
+ def is_direct_successor(self, child):
+ if child in self.children_list:
+ return True
+ else:
+ return False
+
+ def gender(self):
+ return self.gender
+
+ def __get_parents_children(self, parent, gender):
+ if parent:
+ return parent.children(gender)
+ else:
+ return []