HolyDominat的专栏

Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. Solution: Code:

Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telephone buttons) is given below. Input:Digit st

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. Solution: Code: