摘要： Given a binary tree, return the postordertraversal of its nodes' values. Example: 非递归的方法，以下第一方法便于理解与记忆。第二个方法不便于记忆； 阅读全文

摘要： Given a binary tree, return the inordertraversal of its nodes' values. Example: Follow up: Recursive solution is trivial, could you do it iteratively? 阅读全文

摘要： Given a binary tree, return the preordertraversal of its nodes' values. Example: Follow up: Recursive solution is trivial, could you do it iteratively 阅读全文

摘要： Given a list, rotate the list to the right by k places, where k is non-negative. For example:Given 1->2->3->4->5->NULL and k = 2,return 4->5->1->2->3- 阅读全文

摘要： struct ListNode { int m_nKey; ListNode* next; } ListNode* reverseList(ListNode* pHead) { ListNode* pReversedHead = nullptr; ListNode* pNode = pHead; ListNode* pPrev = nullptr; while(pNode != nullptr){ 阅读全文

摘要： Given an array and a value, remove all instances of that value in place and return the new length. The order of elements can be changed. It doesn't ma 阅读全文

摘要： Given a linked list, swap every two adjacent nodes and return its head. Example: Note: Your algorithm should use only constant extra space. You may no 阅读全文

摘要： You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return ... 阅读全文

摘要： 1，拷贝动态库dll文件到程序运行目录下；2，使用qt打开生成动态库的cpp文件，设置断点即可调试。（不需要拷贝需要的cpp文件到源码目录，使用qt到该cpp文件所在目录打开即可）；3，运行程序，设置断点即可； 阅读全文

摘要： 如何编译libcurl支持openssl0，查看下载的libcurl的文档，F:\curl_openssl\curl-7.65.3\winbuild\BUILD.WINDOWS.txt里面有详细的介绍以及编译方法。（看官方文档参照编译才是最正规的方法，遇到问题再去搜索方法解决）1，编译时需要配置参数 阅读全文