寻找素数:
class Solution:
"""
@param n: an integer
@return: return all prime numbers within n.
"""
def prime(self, n):
# write your code here
a = []
for i in range(1,n+1):
b = 0
for j in range(1,i+1):
if i % j == 0:
b += 1
if b ==2:
a.append(i)
return a