千心的无名小站

摘要： https://leetcode.cn/problems/add-two-numbers/description/ Add Two Numbers #include<iostream> using namespace std; struct ListNode { int val; ListNode* 阅读全文

摘要： y, así, el acometer los leones que ahora acometí derechamente me tocaba, puesto que conocí ser temeridad esorbitante, porque bien sé lo que es valentí 阅读全文

摘要： In the tapestry of time's gentle weave, Moon ascends, its light does cleave, Stars shine bright, as dreams believe, Tales of youth, that the night wil 阅读全文

摘要： 不要把物理公式看作数学公式，请也尊重自然的经验法则。 Don't see the physical formulas as mathematical formulas, please also respect the experience rules of nature. 连接正负极 Connect 阅读全文

摘要： 多线程Multithreading #include <iostream> #include <thread> #include <mutex> #include <condition_variable> std::mutex mtx; std::condition_variable cv; boo 阅读全文

摘要： 中国软件工程师面试常问的问题 Just a "Scientific"(Interview) Explanation for Interview Problems for Software Engineers (most Chinese Interviews) Windows和Linux中的库、对象、 阅读全文

摘要： Road To Reality(Multiple valuedness, natural logarithms)(with explaination) Easy way(Taylor Series, Mathematical Analysis, My method) \(e^z=\sum_{k=0} 阅读全文

摘要： Road To Reality(The roots of science) The Good, the True, and the Beautiful 阅读全文

摘要： C++ 贪吃蛇(Snake)，SDL，bug g++ .\Untitled-2.cpp -lmingw32 -lSDL2main -lSDL2 -lSDL2_ttf SDL #include <SDL2/SDL.h> #include <SDL2/SDL_ttf.h> #include <iostr 阅读全文

摘要： class Solution { public: int findTheWinner(int n, int k) { int ans = 0; for (int i = 2; i <= n; ++i) { ans = (ans + k) % i; } return ans + 1; } }; 每次报 阅读全文