![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
剑指
牛客网剑指offer
懒得减肥的雪胖子
每天进步一点点,你就知道我能有多厉害
展开
-
牛客-合并两个排序的链表
牛客-合并两个排序的链表初始化一个新的节点第一个链表的节点p值与第二个链表的节点q值进行比较,第一个节点小,则p后移,否则q后移直到某个链表遍历完,然后接上剩余未遍历完的链表因为新节点newHead的next才开始赋值的,所以返回的是newHead.next/*struct ListNode { int val; struct ListNode *next; ListNode(int x) : val(x), next(NULL) { }};*/class Solution原创 2020-06-02 22:46:33 · 146 阅读 · 0 评论 -
牛客-链表中倒数第k个节点
牛客-链表中倒数第k个节点思路1:设链表的长度为len倒数第k个就是正数第len-k+1个/*struct ListNode { int val; struct ListNode *next; ListNode(int x) : val(x), next(NULL) { }};*/ListNode* FindKthToTail(ListNode* pListHead, unsigned int k) { if (pListHead==NULL) {原创 2020-06-01 23:11:00 · 172 阅读 · 0 评论 -
牛客-二进制中1的个数
牛客-二进制中1的个数#include <stdio.h>#include <queue>#include <stack>#include <math.h>#include <map>#include <string.h>#include <string>#include <cstring>#include <set>#include <algorithm>#incl原创 2020-05-24 20:39:17 · 146 阅读 · 0 评论 -
牛客-矩形覆盖
牛客-矩形覆盖#include <stdio.h>#include <queue>#include <stack>#include <math.h>#include <map>#include <string.h>#include <string>#include <cstring>#include <set>#include <algorithm>#include原创 2020-05-24 19:44:35 · 114 阅读 · 0 评论 -
牛客-变态跳台阶
牛客-变态跳台阶2^(n-1)次方#include <stdio.h>#include <queue>#include <stack>#include <math.h>#include <map>#include <string.h>#include <string>#include <cstring>#include <set>#include <algorithm>原创 2020-05-24 19:34:31 · 101 阅读 · 0 评论 -
牛客-跳台阶
牛客-跳台阶#include <stdio.h>#include <queue>#include <stack>#include <math.h>#include <map>#include <string.h>#include <string>#include <cstring>#include <set>#include <algorithm>#include &原创 2020-05-24 18:45:38 · 110 阅读 · 0 评论 -
牛客-旋转数组的最小值
牛客-旋转数组的最小值#include <stdio.h>#include <queue>#include <stack>#include <math.h>#include <map>#include <string.h>#include <string>#include <cstring>#include <set>#include <algorithm>#incl原创 2020-05-24 18:27:25 · 103 阅读 · 0 评论 -
牛客-用两个栈实现队列
牛客-用两个栈实现队列#include <stdio.h>#include <queue>#include <stack>#include <math.h>#include <map>#include <string.h>#include <string>#include <cstring>#include <set>#include <algorithm>#incl原创 2020-05-24 18:05:19 · 117 阅读 · 0 评论 -
牛客-重建二叉树
牛客-重建二叉树#include <stdio.h>#include <queue>#include <stack>#include <math.h>#include <map>#include <string.h>#include <string>#include <cstring>#include <set>using namespace std; struct Tre原创 2020-05-18 21:54:50 · 147 阅读 · 0 评论 -
牛客-从尾到头打印链表
牛客-从尾到头打印链表#include <stdio.h>#include <queue>#include <stack>#include <math.h>#include <map>#include <string.h>#include <string>#include <cstring>#include <set>using namespace std;struct Li原创 2020-05-18 20:46:59 · 94 阅读 · 0 评论 -
牛客-替换空格
牛客-替换空格if (str == NULL || length < 0) { return; } int originLen = 0; int blankNum = 0; for (int i=0; str[i]!='\0'; i++) { originLen++; if (str[i]==' ') { blankNum++;原创 2020-05-18 20:03:03 · 105 阅读 · 0 评论 -
牛客-二维数组中的查找
牛客-二维数组中的查找class Solution {public: bool Find(int target, vector<vector<int> > array) { if (array.empty()) { return false; } int col = array[0].size(); int row = array.size(); for (int i=原创 2020-05-18 19:26:55 · 127 阅读 · 0 评论 -
牛客-反转链表
牛客-反转链表/*struct ListNode { int val; struct ListNode *next; ListNode(int x) : val(x), next(NULL) { }};*/class Solution {public: ListNode* ReverseList(ListNode* pHead) { if (pHead == NULL) return NULL; ListNode *cur, *p=NULL,原创 2020-05-18 11:38:24 · 89 阅读 · 0 评论 -
牛客-二叉树层序遍历
牛客-二叉树层序遍历#include <stdio.h>#include <queue>#include <stack>#include <math.h>#include <map>#include <string.h>#include <string>#include <set>using namespace std;struct TreeNode { int val;原创 2020-05-18 11:36:39 · 142 阅读 · 0 评论