完成了第二题

question2.py

@@ -0,0 +1,32 @@
+def feb(n):
+    a = 1 
+    b = 1
+    lis = []
+    while(a < n):
+        lis.append(a)
+        temp = a
+        a = b
+        b += temp
+    return lis
+
+def get_prime(n):
+    primes = [True] * (n+1)
+    p = 2
+    while p ** 2 <= n:
+        if primes[p]:
+            for i in range(p * 2, n + 1, p):
+                primes[i] = False
+        p += 1
+    primes = [i for i in range(2, n) if primes[i]]
+    return primes
+
+def is_palindrome(s):
+    for sep in range(0, len(s)//2):
+        if s[sep] != s[len(s) - sep - 1]:
+            return False
+    return True
+
+if __name__ == "__main__":
+    print(feb(1000))
+    print(get_prime(1000))
+    print(is_palindrome('aabbaa'))