328. 奇偶链表
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ class Solution { public ListNode oddEvenList(ListNode head) { if (head == null || head.next == null) return head; ListNode odd = head; ListNode even = head.next; int cnt = 1; ListNode curr = even.next; even.next = null; while(curr != null){ ListNode tmp = curr; curr = curr.next; if(cnt == 1){ tmp.next = odd.next; odd.next = tmp; odd = tmp; cnt--; }else { tmp.next = even.next; even.next = tmp; even = tmp; cnt++; } } return head; } }
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步