Python序列练习题【第十二周】

Python编程函数题【第十二周】

一、寻找最长连续递增子序列

a = list(map(int,input().split(",")))
t = 1
ans = 0

for i in range(len(a)-1):
    if a[i] < a[i+1]:
        t += 1
    else:
        ans = max(ans,t)
        t = 1

ans = max(ans,t)
print(ans)

二、求和运算

num=list(map(int,input().split(",")))
n=eval(input())

nums=list(set(num))

s=[]
while n!=0:
   a=eval(input())
   s.append(a)
   n=n-1

def fun(nums,res):
    if len(nums) < 2:
        return
    t=[]
    for i in range(0, len(nums) - 1):
        for j in range(i+1, len(nums)):
            if nums[i] + nums[j] == res:
                t.append((nums[i],nums[j]))
    return t

t={}
f=0
for i in s:
    t[i]=fun(nums,i)
    if t[i]== []:
        f=f+1

if f==len(s):
    print("None")
else:
    print(t)

三、寻找缺失的整数

s, n = input().split()
n=eval(n)
a=list(map(int,s.split(",")))

a.sort()


t=[]
for i in range(a[0],a[len(a)-1]):
    t.append(i)


t.extend(a)


f=[]
for i in t:
    if t.count(i)==1:
        f.append(i)


if n<=0 or n>=len(f):
    print("Out Of Range!")
else:
    print("The {:d}th missing integer is {:d}!".format(n,f[n-1]))

lst, n = input().split()
lst = sorted(list(map(eval,lst.split(','))))
n = eval(n)
flag = 0
f = 0
for i in range(min(lst),max(lst)+1):
    if i not in lst:
        flag += 1
        if flag == n:
            f = 1
            aim = i
if f == 1 and n > 0:
    print('The {0}th missing integer is {1}!'.format(n,aim))
elif f == 0 or n <= 0:
    print('Out Of Range!')

四、求矩阵局部极大值

#include <iostream>
using namespace std;
int a[1010][1010];
int main()
{
	int n,m;
	cin>>n>>m;
	
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			cin>>a[i][j];
		}
	}
	
	int flag=0;
	for(int i=2;i<=n-1;i++)
	{
		for(int j=2;j<=m-1;j++)
		{
			if(a[i][j]>a[i+1][j]&&a[i][j]>a[i][j+1]&&a[i][j]>a[i-1][j]&&a[i][j]>a[i][j-1])
			{
				flag=1;
				cout<<a[i][j]<<" "<<i<<" "<<j<<endl; 
			}
			
		}
	}
	
	if(flag==0)
	cout<<"None"<<" "<<n<<" "<<m;
	return 0;
	
	
 }