第一題：輸出元素個數統計，ac100%
n,m = [int(i) for i in input().split(' ')]
a = [int(i) for i in input().split(' ')]
a = sorted(a)
query =
for _ in range(m):
m = {}.fromkeys(query)
for key in m.keys():
m[key] = 0
for i in range(len(a)):
if a[i] in m:
m[a[i]] += 1
for k in query:
print(m[k])
def slove(a,b,c,aa,bb,cc):
if(a==0 and b==0 and c==0):
return max(aa,bb,cc)
if(a>0):
return min(slove(a-1,b,c,aa+1,bb,cc),slove(a-1,b,c,aa,bb,cc+1))
elif(b>0):
return min(slove(a,b-1,c,aa+1,bb,cc),slove(a,b-1,c,aa,bb+1,cc))
elif(c>0):
return min(slove(a,b,c-1,aa,bb,cc+1),slove(a,b,c-1,aa,bb+1,cc))
for _ in range(n):
a,b,c = [int(i) for i in input().split(' ')]
print(slove(a,b,c,0,0,0))
for _ in range(c):
input()
a = [int(i) for i in input().split(' ')]
suma = sum(a)
target = suma//2
if(suma%2==1):
print("no")
continue
find = false
# o(n^2)
for i in range(len(a)):
sum_local = 0
for j in range(i+1,len(a)):
sum_local += a[j]
if(sum_local==target):
print("yes")
find = true
break
if find:
break
if not find:
print("no")
def zeros(n,m):
return [[0 for i in range(m)] for j in range(n)]
def slove(a,k,super_power):
n = len(a)
dp = zeros(len(a),2)
dp[n-1][0] = 1
dp[n-1][1] = 1
for i in range(n-1)[::-1]:
for j in range(1,k+1):
if i+ja[i] and dp[i+j][0]==1) else 0
return dp[0][1]
c = int(input())
for _ in range(c):
n,k = [int(i) for i in input().split(' ')]
a = [int(i) for i in input().split(' ')]
if(slove(a,k,1)):
print("yes")
else:
print("no")
2013網易校園招聘筆試題
1 假設進棧次序是e1,e2,e3,e4，那可能的出棧次序是 a e2,e4,e3,e1 b e2,e3,e4,e1 c e3,e2,e4,e1 d e1,e2,e4,e3 給定入棧順序，求出可能的出棧順序。點評 老得掉渣得題目了，只要小心點都沒有問題 2 表示式x a b c d e的字尾表示形式...
2019網易校招
尺取法滑動視窗 時間複雜度o n 字首和後二分 時間複雜度o mlogn 暴力列舉每團雜物4 4次旋轉 時間複雜度o 256 n 1 include2 include3 include4 using namespace std 56 struct point 1011 point operator ...
2015網易遊戲校園招聘筆試題 研發崗
題量比較大，大題有6個。1.最小字典序字串，2.遞迴繪圖函式轉非遞迴 3.遊戲程式設計中常用的資料結構4叉樹，有三問，一問是寫出如何判斷點在矩形中和判斷兩矩形是否相交，第二問是寫建立四叉樹的實現，第三問是如何根據已知的矩形塊，在四叉樹中尋找包含的物體。4.kd樹，英文題，沒怎麼看，第一問問給出的乙個...