摘要: int lastRemaining(int n){ return (n==1)?1 :2 * (n/2 - lastRemaining(n/2) + 1); } int lastRemaining(int n){ int stack[100]={0}, pst=-1, i, res=1; for(i 阅读全文
posted @ 2021-02-04 16:29 温暖了寂寞 阅读(59) 评论(0) 推荐(0) 编辑