斐波那契数列
#coding:utf-8
'''
1、斐波纳契数列：这里有一组数：1、1、2、3、5、8、13、21、34、55......
要求计算用这个递归算法，计算出这组数的第40个数是多少？'''
def func(number):
if number ==1 or number ==2:
return 1
res = func(number-1)+func(number-2)
return res
if __name__ =='__main__':
print func(40)
#coding:utf-8
'''
4、写一个方法，传入一个整型列表，计算其中不重复数字的个数并返回'''
def func(number_list):
res =list()
for iin number_list:
if number_list.count(i)==1:
res.append(i)
return len(res)
if __name__ =='__main__':
print func([1,2,3,4,1])
#coding:utf-8
'''
1、鸡兔同笼，从上面看有35个头，从下面看有94只脚，请问鸡有几只，兔有几只？
假设兔子为x,鸡为y
'''
def func(head,foot):
for xin range(1,head):
y = head-x
if (4*x)+(2*y) == foot:
return x,y
a = func(35,94)
print a
#coding:utf-8
'''
2、编程求一个四位自然数ABCD,它乘以A后变成DCBA
'''
def func(numbers):
res =list()
for numberin range(1000,numbers):
if number*(number//1000) == (number %100 %10)*1000+(number%100//10)*100+(number//100%10)*10+number//1000:
res.append(number)
return res
if __name__ =='__main__':
print func(10000)
