New coder, Step further

leetcode, 单调栈，monotonic stack, stack, array, 数组

Callback in C++非原创，转载自：https://stackoverflow.com/questions/2298242/callback-functions-in-c文章目录Callback in C++非原创，转载自：https://stackoverflow.com/questions/2298242/callback-functions-in-c@[TOC](文章目录)1. What are callables in C++(11)2. Function Pointer2.1 n

快排，partition单独使用，leetcode原题

c/c++多维数组动态分配

向量 vector 是一种对象实体, 能够容纳许多其他类型相同的元素, 因此又被称为容器。 与string相同, vector 同属于STL(Standard Template Library, 标准模板库)中的一种自定义的数据类型, 可以广义上认为是数组的增强版。在使用它时, 需要包含头文件 vector, #include<vector>vector 容器与数组相比其优点在于它能够根据需要随时自

基本容器有： vector： flexible sized array, random access deque: double-ended queue, random access list: doubly linked list, bi-directional sequential access forward_list: singly linked list, sing

Problem:You are given a data structure of employee information, which includes the employee’s unique id, his importance value and his direct subordinates’ id.For example, employee 1 is the leader of em

leetcode 692, top k frequent words, coded in c++

leetcode 695

reverse_iterator: 反向迭代器A copy of the original iterator (the base iterator) is kept internally and used to reflect the operations performed on the reverse_iterator: whenever the reverse_iterator is in...

In hashing, a set of keys is stored in an array called hash table. Insertion, deletion, and finding are based on hash function. hash function maps each possible key with certain index to the hash

C和C++中对数组在函数传递中的处理

值传递，引用传递，指针传递

heap定义，排序，堆排序c++源代码

STL中最常用的pair和map功能解析

找出第n个super ugly number;prime factor， priority queue；

链表里的插入法排序，leetcode原题

合并两个排序完成的序列，很多算法里的基本操作；leetcode原题

sorting algorithms

variable and types, from c++ primer

memset用法介绍

指针和引用的区别以及在处理常量时应该注意的事

use heap to implement priority queue, mainly max priority queue.