#和牛牛一起刷题打卡# public ListNode reverseBetween (ListNode head, int m, int n) { // write code here int i=1; ListNode d= new ListNode(0); d.next=head; ListNode h=head; ListNode h0=d; while(i { h0=h; //前方节点 h=h.next; i++; } head=h; while(i { ListNode nxt=head.next; head.next=nxt.next; nxt.next=h0.next; h0.next = nxt; i++; } return d.next; }