jeiwt的专栏

单向扫描//单向的void qsort1(int *arr, int begin, int end){ if(begin >= end) return ; int m = begin; //Assert arr[begin+1....m] =arr[begin] ) for(int i=begin+1; i<=end; i++) { if(arr[i]

思路：分别记录root到两个节点的路径。路径知道了，从root开始，不一样的分支点上级就是最近祖先。 路径的查找方法有二：深度优先遍历并查集（不懂） 介绍DFS先，关注传入的参数path为root到节点的路径。DFS方法如果查找成功返回查找的长度;否则返回-1。#include using namespace std;typedef stru

<br />void PreOrder(Node *root){ if(root == NULL) return ; Node *p = root; stack<Node *> s; s.push(p); while(!s.empty()) { Node *node = s.pop(); visit(node); if(n

//recursion链表倒置法1Node * reverse(Node * head){ if(head == NULL || head->next == NULL) return head; Node * q = head->next; //先翻转head->next Node * newHead = reverse

原帖http://blog.youkuaiyun.com/v_july_v/article/details/7041827#comments