字符串排序
http://www.nowcoder.com/practice/5af18ba2eb45443aa91a11e848aa6723
方法1
num = int(input())
in_list = [input() for x in range(num)]
in_list_s = []
in_list_s = sorted(in_list)
for x in in_list_s:
print(x)
方法2:
n = int(input())
L = []
for i in range(n):
L.append(input())
L.sort()
for x in L:
print(x)相关推荐
投递阿里巴巴集团等公司10个岗位 
球球与墩墩：这不是前端常考的对象扁平化吗，面试官像是前端出来的
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道真题和解析 
顺丰集团工作强度 309人发布