两个练习

Jack-Lee-Hiter · Jack-Lee-Hiter · commit e69e249b4301 · 2016-07-26T11:31:46.000+08:00
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
diff --git a/Target Offer/带锁的门.py b/Target Offer/带锁的门.py
@@ -0,0 +1,19 @@
+'''
+走廊上有n个带锁的门,从1到n依次编号。最初所有的门都是关着的。我们从门前经过n次,每次都是从1号门开始。
+在第i次经过的时候改变第i个整数倍号所的状态。
+在最后一次经过的后, 哪些门是打开的, 输出打开门的序号
+'''
+
+def openDoor(n):
+    if n == None or n <= 0:
+        return
+    doorList = [0] * (n+1)
+    for i in range(1, len(doorList)):
+        j = i
+        while j <= n:
+            doorList[j] = 1 - doorList[j]
+            j += i
+    output = [i for i, x in enumerate(doorList) if x != 0]
+    return output
+
+print(openDoor(16))
diff --git a/Target Offer/输出连续质数序列.py b/Target Offer/输出连续质数序列.py
@@ -0,0 +1,24 @@
+'''
+输入一个整数, 输出不大于这个整数的所有连续的质数序列
+认为1不是质数
+'''
+
+def Sieve(n):
+    if n == None or n <= 1:
+        return
+    temp = [0]*(n+1)
+    for p in range(2, len(temp)):
+        temp[p] = p
+    for p in range(2, int(n**0.5)+1):
+        if temp[p] != 0:
+            j = p * p
+            while j <= n:
+                temp[j] = 0
+                j += p
+    output = []
+    for i in temp:
+        if i != 0:
+            output.append(i)
+    return output
+
+print(Sieve(29))
