火车进站
https://www.nowcoder.com/practice/97ba57c35e9f4749826dc3befaeae109
lst = []
def f(wait,stack,out):
if wait:
f(wait[1:],stack+[wait[0]],out)
if stack:
f(wait,stack[:-1],out+[stack[-1]])
if not wait and not stack:
lst.append(' '.join(map(str,out)))
N = int(input())
ls = list(map(int,input().split()))
f(ls,[],[])
lst.sort()
for i in lst:
print(i)
相关推荐
球球与墩墩：这不是前端常考的对象扁平化吗，面试官像是前端出来的
const flattern = (obj) => {
const res = {};
const dfs = (curr, path) => {
if(typeof curr === 'object' && curr !== null) {
const isArray = Array.isArray(curr);
for(let key in curr) {
const newPath = path ? isArray ? `${path}[${key}]` : `${path}.${key}` : key;
dfs(curr[key], newPath);
}
} else {
res[path] = curr
}
}
dfs(obj);
return res;
}
查看3道真题和解析
说又不是不能用的：之前也想回老家，结果发现除了考公和靠关系的工作，根本没适合的岗位，省会合肥的竞争比北上广还卷，最后还是认清现实：普通人想赚钱，只能去大城市😭 
