pengyu2003

摘要： You are given a string,S, and a list of words,L, that are all of the same length. Find all starting indices of substring(s) in S that is a concatenation of each word in L exactly once and without any intervening characters.For example, given:S:"barfoothefoobarman"L:["foo", " 阅读全文

摘要： Mergeksorted linked lists and return it as one sorted list. Analyze and describe its complexity.学习并练习 priority_queue.priority_queue的几个重要函数 push pop top./** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * };... 阅读全文