MIT6001x_Intro2CS_and_Python/L11_problem5.py at master · waveman68/MIT6001x_Intro2CS_and_Python · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
# my solution

# class intSet(object):
#     """An intSet is a set of integers
#     The value is represented by a list of ints, self.vals.
#     Each int in the set occurs in self.vals exactly once."""
#
#     def __init__(self):
#         """Create an empty set of integers"""
#         self.vals = []
#
#     def insert(self, e):
#         """Assumes e is an integer and inserts e into self"""
#         if not e in self.vals:
#             self.vals.append(e)
#
#     def member(self, e):
#         """Assumes e is an integer
#            Returns True if e is in self, and False otherwise"""
#         return e in self.vals
#
#     def remove(self, e):
#         """Assumes e is an integer and removes e from self
#            Raises ValueError if e is not in self"""
#         try:
#             self.vals.remove(e)
#         except:
#             raise ValueError(str(e) + ' not found')
#
#     def __str__(self):
#         """Returns a string representation of self"""
#         self.vals.sort()
#         return '{' + ','.join([str(e) for e in self.vals]) + '}'
#
#     def intersect(self, other):
#         return_set = intSet()
#         my_set = eval(self.__str__())
#         for s in my_set:
#             if other.member(s):
#                 return_set.insert(s)
#         return return_set
#
#     def __len__(self):
#         l = 0
#         my_set = eval(self.__str__())
#         for s in my_set:
#             l += 1
#         return l
#
# setA = intSet()
# setB = intSet()
# for s in {-11,-10,-9,-5,3,11,12,15,16}:
#     setA.insert(s)
# for s in {-16,-6,-3,-1,0,1,5,7,9,15}:
#     setB.insert(s)
# setA.intersect(setB)


# more elegant, since I missed the access to the values w/ self.vals
class intSet(object):
    """An intSet is a set of integers
    The value is represented by a list of ints, self.vals.
    Each int in the set occurs in self.vals exactly once."""

    def __init__(self):
        """Create an empty set of integers"""
        self.vals = []

    def insert(self, e):
        """Assumes e is an integer and inserts e into self"""
        if not e in self.vals:
            self.vals.append(e)

    def member(self, e):
        """Assumes e is an integer
           Returns True if e is in self, and False otherwise"""
        return e in self.vals

    def remove(self, e):
        """Assumes e is an integer and removes e from self
           Raises ValueError if e is not in self"""
        try:
            self.vals.remove(e)
        except:
            raise ValueError(str(e) + ' not found')

    def __str__(self):
        """Returns a string representation of self"""
        self.vals.sort()
        return '{' + ','.join([str(e) for e in self.vals]) + '}'

    def intersect(self, other):
        return_set = intSet()
        my_set = eval(self.__str__())
        for s in my_set:
            if other.member(s):
                return_set.insert(s)
        return return_set

    def __len__(self):
        l = 0
        my_set = eval(self.__str__())
        for s in my_set:
            l += 1
        return l