private Node revert(Node head) { Node pre = null; Node next; while (head!=null){ next = head.next; head.next = pre; pre = head; head = next; } return pre; }
手写链表逆序代码
最新推荐文章于 2021-05-19 18:18:47 发布
private Node revert(Node head) { Node pre = null; Node next; while (head!=null){ next = head.next; head.next = pre; pre = head; head = next; } return pre; }