摘要: 题目:找到两个linkedlist起始交集部分 如果没有交集,推出 O(1) public class solution{public ListNode getIntersect(ListNode headA, ListNode headB){if(headA==null||headB==null) 阅读全文
posted @ 2022-07-12 01:56 flag! 阅读(21) 评论(0) 推荐(0)
摘要: class Solution { public ListNode oddEvenList(ListNode head) { if(head==null) return null; ListNode odd=head,even=head.next,evenHead=even; while(even!= 阅读全文
posted @ 2022-07-12 01:45 flag! 阅读(20) 评论(0) 推荐(0)
摘要: class Solution { public ListNode oddEvenList(ListNode head) { if(head==null) return null; ListNode odd=head,even=head.next,evenHead=even; while(even!= 阅读全文
posted @ 2022-07-12 01:44 flag! 阅读(26) 评论(0) 推荐(0)
摘要: class Solution { public ListNode oddEvenList(ListNode head) { if(head==null) return null; ListNode odd=head,even=head.next,evenHead=even; while(even!= 阅读全文
posted @ 2022-07-12 01:42 flag! 阅读(16) 评论(0) 推荐(0)
摘要: so simple for this problem, but when I review it ,there are sill some main points which should be noticed. 1. dummy 2. carray. 3. after while l1,l2 != 阅读全文
posted @ 2022-07-12 01:33 flag! 阅读(18) 评论(0) 推荐(0)