注册一亩三分地论坛,查看更多干货!
您需要 登录 才可以下载或查看附件。没有帐号?注册账号 
x
1hr10min 4道coding都挺简单的,求大米~
1. Given an array of nunbers, 算even和odd index的和,比大小
2. Simple version control system
Input:
logs= [
"switch branch1",
"push file1",
"push file2",
"switch branch2",
"push file1",
"switch branch1",
"push file3",
"push file2"]
ks if a block of size can fit ending at x without overlapping any obstacles, returning “1” if possible, otherwise “0”.
Input:
operations = [
[1, 2],
[1, 5],
[2, 5, 2],
[2, 6, 3],
[2, 2, 1],
[2, 3, 2]
]
Output: “1010”
|