【leetcode】Intersection of Two Linked Lists
判断链表是否相交,并求交点(不包括环的情况class Solution {
public:
ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
if(headA==NULL||headB==NULL) return NULL;
ListNode *p=headA;
原创
2015-10-06 16:18:41 ·
146 阅读 ·
0 评论