小小程序员

class Solution {public: ListNode* deleteDuplicates(ListNode* head) { ListNode dummy(-1), *pre = &dummy, *iter; dummy.next = head; while (pre && pre->next) { if

class Solution {public:    bool isSymmetric(TreeNode* rootl, TreeNode* rootr){        if (!rootl && !rootr)            return true;        else if (rootl && rootr && rootl->val == rootr->val

class Solution {public: int helper(TreeNode* root, int target) { if (root && !root->left && !root->right) return target * 10 + root->val; else if (!root) return 0;

class BSTIterator {public: BSTIterator(TreeNode *root) { while (root) { lst.push_back(root); TreeNode *tmp = root->left; root = root->left; }

class Solution {public: bool helper(int r, int c, int mpRow[][9], int mpCol[][9], int mpGroup[][9], vector >& board) { if (r >= 9) { return true; } if (c >= 9){ c = 0; if (helper(r

class Solution {public: int lengthOfLongestSubstring(string s) { int hash[256] = {0}; int len = s.size(); if (len <= 0) return 0; int maxLen = -1, curL

class Solution {public: void helper(int dot, int pos, int len, vector& res, string& s, string& target) { int deltaLen = len - pos; if (dot == 3) { string tmp = s.substr(pos, de

class Solution {public: void helper(int row, int &res, int n, vector& solution) { if (row == n+1) { ++ res; } for (int i = 1; i <= n; ++ i) { if (canPlac

#include #include #include #include #include using namespace std;class MySort {public: MySort(vector v):m_num(v) {} virtual ~MySort() = 0{} virtual void Sort() = 0; void display() { cop

class Solution {public: ListNode* reverseKGroup(ListNode* head, int k) { if (!head || k <= 0) return head; int len = 0; ListNode dummy(0), *iter = &dummy; dummy.next = he

class Solution {public: int maxArea(vector& height) { int start = 0, end = height.size() - 1; int imax = INT_MIN; while (end > start) { int res = (end - start)

一、归并排序// 归并排序// 2014-2-22#include using namespace std;void Merge(int* array, int p, int q, int r);void MergeSort(int* array, int p, int q);int main(){ int array[10]; for (int

源代码//找最大子数组 数组索引从0开始//2014-2-23#include using namespace std;int* FindMiddle(int* array, int low, int high, int middle);int* FindMax(int* array, int low, int high);extern int* gresult

一、优先队列c++实现源代码#include #include using namespace std;//function: 返回最大值int HeapMaximum(int* array);//function: 返回最大值并删除int HeapRactMax(int*& array, int n);void Exchange(int* a, int

一、二叉搜索书的基本概念、难点前驱：大于该结点关键字的最小关键字的结点后继：小于该结点关键字的最大关键字的结点 删除操作分为三种情况，都调用了结点替换函数；较复杂的情况为要删除的结点有两个孩子，要进行两次替换，第一次将该结点的右子树中的最小值与该结点的右孩子替换，第二次将该结点与该结点的右子树替换。最后都会调用delete释放内存。 二、完整源代码#include

一、红黑树的基本概念性质：1、根结点的颜色是黑色2、红结点的两个孩子都为黑色3、根结点的父结点，所有叶子结点都为黑色（在程序中用NIL替换）4、每个结点到其所有后代叶结点的简单路径上，均包含相同数目的黑色结点 黑高：从某个结点出发（不含该结点）到达一个叶结点的任意一条简单路径上的黑色结点个数称为该结点的黑高 二、c++源代码#include using

源代码//拓扑排序//2014-3-13#include #include using namespace std;#define MAX_VERTEXS 100class Graph{public: typedef struct _ArcNode //顶点 结构体 { int nkey; _ArcNode* next; _Ar

一、测试数据输入顶点数和边数:7 12请输入边:第1条边:1 2 2第2条边:1 4 1第3条边:2 4 3第4条边:2 5 10第5条边:3 1 4第6条边:3 6 5第7条边:4 3 2第8条边:4 5 2第9条边:4 6 8第10条边:4 7 4第11条边:5 7 6第12条边:7 6 1请输入起始结点和终止结点:1 6BFS:

#include #include using namespace std;class MySort {public: MySort(vector v):m_num(v) {} virtual ~MySort() = 0{} virtual void Sort() = 0; void display() { copy(m_num.begin(), m_num.end(),