shopee written test

This commit is contained in:
jiet07
2021-08-05 09:51:41 +08:00
parent f223736c90
commit 69ae526ed4
5 changed files with 39 additions and 1 deletions

View File

@@ -0,0 +1,23 @@
# import lib
#https://blog.csdn.net/elma_tww/article/details/86538836
# def functions
#dp[i][j]表示将整数i划分为j份的方案数
#dp[i-j],拿出j个数分别放上1dp[i-j][2],2表示分为两份
def divide(n,k,dp):
for i in range(1,n+1):
for j in range(1,k+1):
if i>=j:#划分的分数不能超过给定的整数
dp[i][j]=dp[i-j][j]+dp[i-1][j-1]#裂项相消
print(i,j,dp[i][j])
return dp[n][k]
#main
if __name__ == "__main__":
n,k = map(int,input().split(','))
# n = int(n)
# k = int(k)
dp = [[0] *(k+1) for i in range(n+1)]
dp [0][0]=1
#print(dp)
result = divide(n,k,dp)
print(result)

View File

@@ -0,0 +1,15 @@
def findBalancedIndex(arr):
for temp in range(1,len(arr)):
# a=sum(arr[:temp])
# print(a)
# b=sum(arr[temp+1:])
# print(b)
if sum(arr[:temp])==sum(arr[temp+1:]):
#print(temp)
return temp
result1 = findBalancedIndex([1,2,3,4,6])
result2 = findBalancedIndex([1,2,1])
result3 = findBalancedIndex([1,2,2,2,1])
print(result1)
print(result2)
print(result3)

View File

@@ -0,0 +1 @@
2021-8-2 shopee-提前批-笔试----jiet07

View File

@@ -1 +0,0 @@