📍面试公司:虾皮一面: 拷打项目(30min左右,没答好)给出n,k两个数,从1..n这n个数里面,列出所有k个数的组合情况,比如n=4,k=2,给出 [[1,2], [1,3] , [1,4], [2,3], [2,4], [3,4]] (回溯)📍面试公司:富途一面:SQL:给你一张STUDENT 表 | id | subject | score | | ---------| ------- | ----- | | S001 | A | 90 | | S002 | A | 95 | | S002 | C | 60 | | S003 | A ...