每日编程题 01

寒假来临，一起做做题目，gogogogo！！

三道编程题

每道题目均采用python进行编程实现

洗牌问题

输入一个数组，使其每个数在每个位置的概率相同

1. 调用numpy里面的shuffle
2. 自己编写–>注意条件概率

import random
def Myshuffle(nums):
	"nums为列表 "
	for i in range(len(nums)):
		k = i + random.randint(0, len(nums)-i-1)
		nums[k], nums[i] = nums[i], nums[k]

3.测试代码是否正确

"测试代码 "
def test(f):
	"f代表所写的洗牌函数"
	result = [[0 for i in range(10)] for j in range(10)]
	for i in range(1000):
        A = [i for i in range(0, 10)]
        f(A)
        for j in range(len(A)):
            result[A[j]][j] += 1
        
    print('\n'.join([''.join(['{:6}'.format(item) for item in row]) 
          for row in result]))

计算质数

计算素数函数小于等于N
例： N（17）= 7， 2,3,5,7,11,13,17

def ComputePrime(nums):
	"计算质数函数 采用空间换时间"
	prime = [True] * (nums + 1)
	i = 2
	while(i*i<=nums):
		if prime[i]:
			j = i
			while(j*i <= nums):
				prime[j*i] = False
				j += 1
		i += 1
	
	count = []
	for i in range(2, nums+1):
		if prime[i]:
			count.append(i)
	return count,len(count)

哥德巴赫猜想

任一大于2的偶数都可写成两个质数之和。比如16=13+3。
需要先找到小于等于N的质数，两个指针进行找寻计算。

def Guess(nums):
    "哥德巴赫猜想"
    prime = [True] * (nums + 1)
    i = 2
    while(i*i <= nums):
        if prime[i]:
            j = i
            while(j*i <= nums):
                prime[j*i] = False
                j += 1
        i += 1
        
    count = []
    for i in range(2, nums+1):
        if prime[i]:
            count.append(i)
    
    "两个指针"
    i = 0
    j = len(count) - 1
    
    while(i < j):
        if (count[i] + count[j] == nums):
            print(count[i], '+', count[j], '=', nums)
            i += 1
            j -= 1
        elif (count[i] + count[j] < nums):
            i += 1
        elif (count[i] + count[j] > nums):
            j -= 1

今日三道题目就结束了，gogogo！！