Java merge two sorted lists

Compared with C ++, Java has no confusing pointer, but we cannot deny that in some specific situations, pointers are actually regarded as the last one. Although pointers are not clearly defined in Java, we can use class to implement pointer operations due to the idea of classes. Xiao'er, shangli ----- merges two sorted lists, outputs the header nodes of the merged list, and the elements in the merged list are ordered.

The sample code is as follows:

ListNode (. val =. next = ListNode p1 = ListNode p2 = ListNode fadeHead = ListNode (0 ListNode pHead = (p1! = & P2! = (P1.val <= pHead. next = p1 = pHead. next = p2 = pHead = (p1! = PHead. next = pHead. next =} View Code

 

Due to the memory recycle mechanism in Java, is it possible to prevent the exposure of wild pointers or memory in C ++ or C? Wait for a detailed explanation from Daniel.