Merge Two Sorted Lists

Description

Flashcards on Merge Two Sorted Lists, created by Suhas S on 17/02/2018.
Suhas S
Flashcards by Suhas S, updated more than 1 year ago
Suhas S
Created by Suhas S over 7 years ago
1
0
1 2 3 4 5 (0)

Resource summary

Question Answer
Merge Two Sorted Lists public ListNode mergeTwoLists(ListNode l1, ListNode l2) { if(l1==null) return l2; if(l2==null) return l1; if(l1.val <= l2.val){ l1.next = mergeTwoLists(l1.next,l2); return l1; } if(l2.val <= l1.val){ l2.next = mergeTwoLists(l2.next,l1); return l2; } return null; }
Show full summary Hide full summary

0 comments

There are no comments, be the first and leave one below:

Similar

Delete Node in a BST
Suhas S
Delete a node with a key
Suhas S
Remove Nth Node From End of List
Suhas S
Swap Nodes in Pairs
Suhas S
Odd Even Linked List
Suhas S
Rotate List
Suhas S
Add Two Numbers
Suhas S
Copy List with Random Pointer
Suhas S
GCSE French - The Environment
Abby B
Macbeth Quotes To Learn
Sophie Brokenshire