{"push_id":558189745,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"fac634b823cb9aa5a5ff8777bbfa76aa19b5a349","before":"98e7e28c16d0ae02f0736319853da47f148c2544","commits":[{"sha":"fac634b823cb9aa5a5ff8777bbfa76aa19b5a349","author":{"email":"a8a38b987e91c6a57a29c2183113d0ff76aeb182@gmail.com","name":"waten"},"message":"添加找到倒数第K个节点思维导图\n\n还有一种方法；\n1-遍历一遍链表且依次压入栈中；\n2-在pop() K个元素，则目前栈顶的元素的就是要找的元素","distinct":true,"url":"https://api.github.com/repos/waten1992/Cracking_The_Coding_Interview/commits/fac634b823cb9aa5a5ff8777bbfa76aa19b5a349"}]}