摘要: public void removeSmallest() { Node smallest = head; Node temp = head; Node prev = null; while(temp != null) { if(temp.next != null && temp.next.data 阅读全文
posted @ 2020-09-13 20:52 Jasper2003 阅读(71) 评论(0) 推荐(0) 编辑