_Legolas_的技术专栏

Sort a linked list in O(n log n) time using constant space complexity.自己写了快排的想法，不过实现的很蛋疼，加上搜索的了其他的人的想法，总结了基本的3种实现方法第一种：快排的思想，输出结果一直没问题，提交就提示Time Limit Exceeded，调了好久没用，后来参考：http://blog.csdn.net

Reorder ListGiven a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…You must do this in-place without altering the nodes' values.For example,Giv

Insertion Sort List Sort a linked list using insertion sort./** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int

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.//Definition for singly-linked list.#include using name

Populating Next Right Pointers in Each Node Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each

Implement strStr().Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack.实现了下，KMP算法明显速度提高y

Given numRows, generate the first numRows of Pascal's triangle.For example, given numRows = 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]]

Follow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions.

Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-negative.class Solution {public: string mult

Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".Clarification:What constitutes a word?A sequence of non-sp