yqq1997的博客

01背包问题(二维数组)https://mp.weixin.qq.com/s/FwIiPPmR18_AJO5eiidT6w/*再回顾一下dp[i][j]的含义：从下标为[0-i]的物品里任意取，放进容量为j的背包，价值总和最大是多少。那么可以有两个方向推出来dp[i][j]，由dp[i - 1][j]推出，即背包容量为j，里面不放物品i的最大价值，此时dp[i][j]就是dp[i - 1][j]由dp[i - 1][j - weight[i]]推出，dp[i - 1][j - wei

#include <iostream>#include <algorithm>#include <string>#include <vector>#include <set>#include <random>using namespace std;/*查找算法(13个)：判断容器中是否包含某个值 adjacent_find: 在iterator对标识元素范围内，查找一对相邻重复元素，找到则返回指向这对元素的

ubuntu 20.04不能用 使用 char** ,$ gcc --versiongcc (Ubuntu 10.3.0-1ubuntu1~20.04) 10.3.0Copyright (C) 2020 Free Software Foundation, Inc.This is free software; see the source for copying conditions. There is NOwarranty; not even for MERCHANTABILITY or F

C++11/14/17 新特性总结initializer_list std::vector<int> vctInts({92, 12, 39, 46, 92, 84, -1, 0, -234});auto std::vector<int> vctInts({92, 12, 39, 46, 92, 84, -1, 0, -234}); for (const auto& item : vctInts) { std::cout << item

C++11 并发编程参考书籍: https://chenxiaowei.gitbook.io/c-concurrency-in-action-second-edition-2019/开启线程#include <iostream>#include <thread> // 1void hello() // 2 { std::cout << "Hello Concurrent World\n";}int main(){ std::thread

#include <iostream>#include <memory>#include <string>int main(int argc, char const *argv[]){ // ISO C++ forbids converting a string constant to ‘char*’ char *p = "this is const string"; char pStr[] = "this is test";

use_redis.h#ifndef _REDIS_H_#define _REDIS_H_#include <iostream>#include <string.h>#include <string>#include <stdio.h>#include <hiredis/hiredis.h>class Redis{ public: Redis(){} ~Redis() { this->_conn

#include <bson.h>#include <mongoc.h>#include <stdio.h>intmain (int argc, char *argv[]){ mongoc_client_t *client; mongoc_collection_t *collection; bson_error_t error; bson_oid_t oid; bson_t *doc; mongoc_init (); client = m

mem.h#ifndef MEMCACHEDCLIENT #define MEMCACHEDCLIENT #include <libmemcached/memcached.h>#include<iostream>#include<string.h>#include<time.h>#include <stdlib.h>#include <stdio.h> using std::string;using std:

图图的描述方式:邻接矩阵邻接链表邻接矩阵实现#pragma once#include "graph.h"#include <vector>#include <iostream>#include <iomanip>#include <queue>#include <exception>//#include <string>#define NPOS -1template <typename V,

Trie (前缀树)Trie.hpp/***@time: 2019-11-15 15:43:13*@author: yqq*@descriptions: 实现前缀树*/#ifndef __TRIE_H__#define __TRIE_H__#include <map>#include <string>template < class CharT = char, class StringT = std::string>class T

RBTree#pragma once#include <iostream>#include <stdio.h>#include <string.h>#include <stdlib.h>#include <string>#include <algorithm>#include <vector>#include <list>#include <map>#include &lt

BinarySerachTree#pragma once#include <iostream>#include <stdio.h>#include <string.h>#include <stdlib.h>#include <string>#include <algorithm>#include <vector>#include <list>#include <map>#i

AVLTree#pragma once/***@time: 2019-10-28 18:43:40*@author: yqq*@descriptions: 平衡二叉树*///参考 : https://www.tutorialspoint.com/cplusplus-program-to-implement-avl-tree#include <iostream>#include <stdio.h>#include <string.h>#incl

参考: https://en.cppreference.com/w/cpp/language/coroutinesCoroutinesA coroutine is a function that can suspend execution to be resumed later. Coroutines are stackless: they suspend execution by returning to the caller and the data that is required to res

https://github.com/youngqqcn/ThreadPoolclass ThreadPool{public: // the constructor just launches some amount of m_vctWorkers ThreadPool(size_t nThreads = std::thread::hardware_concurrency()) : stop(false) { if (nThreads <=

这里包含了各编译对c++标准的实现进度:https://en.cppreference.com/w/cpp/compiler_support这里以g++10为例, 关于怎么安装g++10可以参考这篇文章#include <bit>#include <iostream> int main() { if constexpr (std::endian::native == std::endian::big) { std::cout <<

https://askubuntu.com/questions/26498/how-to-choose-the-default-gcc-and-g-version删除update-alternatives中旧的gcc和g++配置:sudo update-alternatives --remove-all gcc sudo update-alternatives --remove-all g++安装It seems that both gcc-4.3 and gcc-4.4 are insta

#include <stdio.h>#include <limits.h>#define NUMCOUNT 10int nums[NUMCOUNT];int snums[NUMCOUNT];#define THRDCOUNT 2void merge(){ int idx[THRDCOUNT]; int pernum = (NUMCOUNT/THRDCOUNT); for(int i = 0; i < THRDCOUNT; i++)

class A{public: A(int a, int b) :_m_a(a),_m_b(_m_a * 2) // 不规范! 不应该依赖初始化的执行顺序! { }private: int _m_b; int _m_a;};class A{public: A(int a, int b) :_m_a(a),_m_b(a * 2) // ok { }private: int _m_b; int _m_a;};...

#include <boost/circular_buffer.hpp>#include <iostream>int main(int argc, char const *argv[]){ boost::circular_buffer<int> buf; buf.resize(3); buf.push_back(1); buf.push_back(2); buf.push_back(3); buf.push_b

以下代码摘自muduo库, 实现的很漂亮, 非常值得学习 , 具体说明可以参考(书<<Linux多线程服务端编程–使用muduo C++网络库>>的P234-P235)dispatcher.h// Copyright 2011, Shuo Chen. All rights reserved.// http://code.google.com/p/muduo///// Use of this source code is governed by a BSD-style

在fork是需要注意父进程中的哪些资源是会被子进程继承的用于管理动态内存和文件描述符的RAII类可以正常工作#include <stdio.h>#include <sys/types.h>#include <unistd.h>#include <string.h>#include <fcntl.h> // openpid_t g_parent_pid = 0;#define NEW_BUF_SIZE 6// 子进程会继承

__thread 使用规则:只能修饰POD类型, 不能修饰class类型, 因为无法自动调用构造函数和析构函数__thread可以修饰全局变量和函数内的静态变量, 但是不能修饰函数的局部变量或者class的普通成员变量.#include <stdio.h>#include <pthread.h>#include <unistd.h>#include <string.h>#include <string>#define THRE

Win7下 qt + vs2017 使用 vs2015编译报错'type_traits': No such file or directory“cl”不是内部或外部命令，也不是可运行的程序或批处理文件问题原因: C:\Program Files (x86)\Microsoft Visual Studio 14.0\VC\vcvarsall.bat 中有两行检查命令, 检查命令失败导致...

前段时间安装 nodejs的一些模块&amp;nbsp;, 添加了环境变量&amp;nbsp;&amp;nbsp;VCTargetsPath, 并设置为 C:\Program Files (x86)\MSBuild\Microsoft.Cpp\v4.0\v140, 并添加到了系统path中.&amp;nbsp;&amp;nbsp;&amp;nbsp;结果导致vs2015不能新建c++项目(创建出来的项目没有文件,只有&quot;外部依赖&quo

第一种函数形参的写法： #include #define R 5 // 行数#define C 5 // 列数void printMatrix ( int a[ ][C] , int row, int column ) // 使用 int a[R][C] 也可以 ， 但是 int a[][] ,就不行！{ int i , j; for ( i = 0; i < row; i+