Recently I learned a library that implements asymmetric coroutine in C, and added some comments to help understand. Actually, it’s a brief library so that we don’t have to cost too much time to read.

std::string_viewstd::string_view is imported in C++17. It stores the address of a string and its length. In some cases, it can avoid the overhead of copying strings such as in the parameter of functio

Difficulty: medium Problem DescriptionEnglish (Find the Index of the First Occurrence in a String)Given two strings needle and haystack, return the index of the first occurren

This series is related to C++20 coroutine.part 1: Generatorpart 2: co_await/co_returnpart 3: Some tips about life cycle when using coroutinespart 4: Some examples about co_awaitpart

This series is related to C++20 coroutine.part 1: Generatorpart 2: co_await/co_returnpart 3: Some tips about life cycle when using coroutinespart 4: Some examples about co_awaitpart

Binary tree traversal is a typical problem to implement. I suppose it’s a required course for every programmer to master. I mean, not only recursive traversals, but also non-recursive traversals in pr

It’s a typical problem to implement a four arithmetic calculator with brackets. 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646

Difficulty: medium Similar problem: LeetCode 1143 - Longest Common Subsequence Problem DescriptionEnglish (Maximum Length of Repeated Subarray)Given t

ProblemWhen opening a solution, Visual Studio is not responding after displaying “reading the file…”. Solution Close the Visual Studio process. Remove the .vs folder in the folder where the solution f

This series is related to C++20 coroutine.part 1: Generatorpart 2: co_await/co_returnpart 3: Some tips about life cycle when using coroutinespart 4: Some examples about co_awaitpart