1.c++入门
- 000.Test检测gcc版本
- 001.Input and Output
- 002.Array and Vector
- 003.File IO
- 004.Align && sizeof
- 005.解除引用
- 006.copy构造函数
- 007.1.特定字符串切割字符串
- 007.2.特定字符串切割字符串优化
- 008.验证码
2.1stl学习
2.2Boost
3.Leetcode
- 1.Two Sum
- 2.Add Two Numbers
- 3.Longest Substring Without Repeating Characters
- 4.Median of Two Sorted Arrays
- 5.Longest Palidromic Substring
- 6.ZigZag Conversion
- 7.Reverse Integer
- 8.String to Integer
- 9.Palindrome Number
- 10.Regular Expression Matching
- 11.Container With Most Water
- 12.Integer to Roman
- 13.Roman to Integer
- 14.Longest Common Prefix
- 15.3Sum
- 16.3Sum
- 17.Letter Combinations of a Phone Number
3.1.其他算法
- 1.二分查找/循环有序查找
- 2.四则运算字符串
- 3.原地翻转数组
- 4.判断链表是否有环
4.图
5.面试
6.设计模式
7.简单面向对象
使用[C语言实现](https://github.com/wenruo95/algorithm/tree/master/base64)
9.C++参考书籍
10.笔记
编译
g++ stl.cc -std=c++11 -o stl.o
author: linkzw
email: linkzw@qq.com