剑指OFFER
qq_lzq
这个作者很懒,什么都没留下…
展开
-
剑指offer 旋转数组的最小数字
https://www.nowcoder.com/practice/9f3231a991af4f55b95579b44b7a01ba?tpId=13&tqId=11159&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking思路一:顺序查找,即查找...原创 2019-10-18 22:17:31 · 69 阅读 · 0 评论 -
剑指offer 剪绳子
https://www.nowcoder.com/practice/57d85990ba5b440ab888fc72b0751bf8?tpId=13&tqId=33257&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking思路一:动态规划, 定义...原创 2019-10-16 22:10:21 · 665 阅读 · 0 评论 -
数组中只出现一次的数字
https://www.nowcoder.com/practice/e02fdb54d7524710a7d664d082bb7811?tpId=13&tqId=11193&tPage=2&rp=4&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking一...原创 2019-08-21 17:02:50 · 80 阅读 · 0 评论 -
数组中的逆序对
https://www.nowcoder.com/practice/96bd6684e04a44eb80e6a68efc0ec6c5?tpId=13&tqId=11188&tPage=2&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking思路...原创 2019-08-21 17:04:18 · 62 阅读 · 0 评论 -
机器人的运动范围
https://www.nowcoder.com/practice/6e5207314b5241fb83f2329e89fdecc8?tpId=13&tqId=11219&tPage=4&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking题目...原创 2019-08-21 17:02:34 · 85 阅读 · 0 评论 -
矩阵中的路径
https://www.nowcoder.com/practice/c61c6999eecb4b8f88a98f66b273a3cc?tpId=13&tqId=11218&tPage=4&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking...原创 2019-08-21 17:02:24 · 120 阅读 · 0 评论 -
顺时针打印矩阵
https://www.nowcoder.com/practice/9b4c81a02cd34f76be2659fa0d54342a?tpId=13&tqId=11172&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking题目描述输入一个矩阵...原创 2019-08-21 17:04:51 · 89 阅读 · 0 评论 -
复杂链表的复制
https://www.nowcoder.com/practice/f836b2c43afc4b35ad6adc41ec941dba?tpId=13&tqId=11178&tPage=2&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking反思...原创 2019-08-21 17:06:20 · 77 阅读 · 0 评论 -
第一个只出现一次的字符
题目描述在一个字符串(0<=字符串长度<=10000,全部由字母组成)中找到第一个只出现一次的字符,并返回它的位置, 如果没有则返回 -1(需要区分大小写).思路:字符在数值上是0~255,所以建立一个长度为256的哈希表,并且以字符为键,以字符出现次数为值。class Solution {public: int FirstNotRepeatingChar(s...原创 2019-08-21 17:04:37 · 50 阅读 · 0 评论 -
数组中出现次数超过一半的数字
题目描述数组中有一个数字出现的次数超过数组长度的一半,请找出这个数字。例如输入一个长度为9的数组{1,2,3,2,2,2,5,4,2}。由于数字2在数组中出现了5次,超过数组长度的一半,因此输出2。如果不存在则输出0。解法一:map容器统计每个数字次数。#include<iostream>#include<vector>#include<stack&...原创 2019-08-21 17:08:59 · 140 阅读 · 0 评论 -
合并两个排序的链表(递归版)
https://www.nowcoder.com/practice/d8b6b4358f774294a89de2a6ac4d9337?tpId=13&tqId=11169&tPage=1&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking...原创 2019-08-21 17:09:05 · 188 阅读 · 0 评论 -
链表中倒数第k个节点
题目描述输入一个链表,输出该链表中倒数第k个结点。思路:双指针,先让一个指针pre走K-1步,然后再让另一个指针step从头指针开始和pre一起走,直到pre走到了指针的尾部模拟过程如下图:class Solution {public: ListNode* FindKthToTail(ListNode* pListHead, unsigned int k) {...原创 2019-08-21 17:09:26 · 66 阅读 · 0 评论 -
变态跳台阶
题目描述一只青蛙一次可以跳上1级台阶,也可以跳上2级……它也可以跳上n级。求该青蛙跳上一个n级的台阶总共有多少种跳法。思路一:用数学解方程的方式去推理关系。设f[n]表示跳n阶台阶的跳法,则有f(n) = f(n-1) + f(n-2) + f(f - 3) +.............f(1) + 1 最后的1表示开始就跳n阶那只有一种跳法了同理的f(n - 1) =...原创 2019-08-21 17:09:37 · 77 阅读 · 0 评论 -
调整数组顺序使奇数位于偶数前面
class Solution {public: void swap(int & a, int & b) { a = a ^ b; b = a ^ b; a = a ^ b; } void reOrderArray(vector<int> &array) { int length = array.size(); ...原创 2019-08-21 17:09:49 · 62 阅读 · 0 评论 -
数值的整数次方
class Solution {public: double Power(double base, int exponent) { double res = 1; if(exponent == 0) return 1; if(exponent > 0)//正常快速幂 { while(exponent) {...原创 2019-08-21 17:09:55 · 69 阅读 · 0 评论 -
剑指offer 构建乘积数组
https://www.nowcoder.com/practice/94a4d381a68b47b7a8bed86f2975db46?tpId=13&tqId=11204&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking思路:如上图构建一个...原创 2019-08-21 17:04:25 · 53 阅读 · 0 评论 -
和为S的两个数字
https://www.nowcoder.com/practice/390da4f7a00f44bea7c2f3d19491311b?tpId=13&tqId=11195&tPage=3&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking题目...原创 2019-08-21 17:06:32 · 52 阅读 · 0 评论 -
丑数
https://www.nowcoder.com/practice/6aa9e04fc3794f68acf8778237ba065b?tpId=13&tqId=11186&tPage=2&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking思路...原创 2019-08-21 17:06:38 · 110 阅读 · 0 评论 -
反转链表
https://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca?tpId=13&tqId=11168&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking/*stru...原创 2019-10-18 22:22:10 · 82 阅读 · 0 评论 -
不用加减乘除做加法
https://www.nowcoder.com/practice/59ac416b4b944300b617d4f7f111b215?tpId=13&tqId=11201&tPage=3&rp=4&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking思路...原创 2019-08-23 11:18:16 · 124 阅读 · 0 评论 -
从上到下打印二叉树
https://www.nowcoder.com/practice/7fe2212963db4790b57431d9ed259701?tpId=13&tqId=11175&tPage=2&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking广度...原创 2019-08-23 11:18:26 · 82 阅读 · 0 评论 -
平衡二叉树
https://www.nowcoder.com/practice/8b3b95850edb4115918ecebdf1b4d222?tpId=13&tqId=11192&tPage=2&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking思路...原创 2019-08-23 11:18:35 · 186 阅读 · 0 评论 -
表示数值的字符串
https://www.nowcoder.com/practice/6f8c901d091949a5837e24bb82a731f2?tpId=13&tqId=11206&tPage=3&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking思路...原创 2019-08-21 17:11:16 · 47 阅读 · 0 评论 -
按之字形顺序打印二叉树
https://www.nowcoder.com/practice/91b69814117f4e8097390d107d2efbe0?tpId=13&tqId=11212&tPage=3&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking思路...原创 2019-08-21 17:06:09 · 61 阅读 · 0 评论 -
圆圈中剩下的数字
https://www.nowcoder.com/practice/f78a359491e64a50bce2d89cff857eb6?tpId=13&tqId=11199&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking思路:建立一个环形链表模...原创 2019-08-21 17:06:02 · 114 阅读 · 0 评论 -
删除链表的重复节点
https://www.nowcoder.com/practice/fc533c45b73a41b0b44ccba763f866ef?tpId=13&tqId=11209&tPage=3&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking思路...原创 2019-08-21 17:06:27 · 51 阅读 · 0 评论 -
字符流中的第一个不重复的字符
https://www.nowcoder.com/practice/00de97733b8e4f97a3fb5c680ee10720?tpId=13&tqId=11207&tPage=3&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking思路...原创 2019-08-21 17:05:55 · 86 阅读 · 0 评论 -
二叉搜索树与双向链表
https://www.nowcoder.com/practice/947f6eb80d944a84850b0538bf0ec3a5?tpId=13&tqId=11179&tPage=2&rp=2&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking思路:中序遍历二叉搜索树...原创 2019-08-21 17:05:47 · 65 阅读 · 0 评论 -
数据流的中位数
https://www.nowcoder.com/practice/9be0172896bd43948f8a32fb954e1be1?tpId=13&tqId=11216&tPage=4&rp=1&ru关于堆操作函数的参考链接https://blog.csdn.net/qq_29630271/article/details/66478256思路:...原创 2019-08-21 17:11:22 · 162 阅读 · 0 评论 -
正则表达式匹配
https://www.nowcoder.com/practice/45327ae22b7b413ea21df13ee7d6429c?tpId=13&tqId=11205&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking思路:分两种情况,即模式...原创 2019-08-21 17:05:35 · 171 阅读 · 0 评论 -
和为S的连续正数序列
https://www.nowcoder.com/practice/c451a3fd84b64cb19485dad758a55ebe?tpId=13&tqId=11194&tPage=3&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking思路...原创 2019-08-21 17:06:45 · 66 阅读 · 0 评论 -
矩形覆盖
class Solution {public: int rectCover(int number) { if(number <= 1) return number; if(number == 2) return 2; int res; int one = 1, two = 2; for(int i ...原创 2019-08-21 17:10:06 · 51 阅读 · 0 评论 -
链表中环的入口地点
https://www.nowcoder.com/practice/253d2c59ec3e4bc68da16833f79a38e4?tpId=13&tqId=11208&tPage=3&rp=3&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking思...原创 2019-08-21 17:05:28 · 98 阅读 · 0 评论 -
扑克牌顺子
https://www.nowcoder.com/practice/762836f4d43d43ca9deb273b3de8e1f4?tpId=13&tqId=11198&tPage=3&rp=3&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking思路:统计0的个数,统...原创 2019-08-21 17:07:56 · 90 阅读 · 0 评论 -
整数中1出现的次数
解法一:直接统计1 - n 每个数字所包含的1的个数时间复杂度是O(n*logn)class Solution {public: int NumberOf1Between1AndN_Solution(int n)//统计1~n中包含1的个数 { int ans = 0; for(int i = 1; i <= n; i++) ans += coun...原创 2019-08-21 17:03:37 · 65 阅读 · 0 评论 -
二叉树中和为某一值的路径
https://www.nowcoder.com/practice/b736e784e3e34731af99065031301bca?tpId=13&tqId=11177&tPage=2&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking纯粹...原创 2019-08-21 17:03:31 · 66 阅读 · 0 评论 -
翻转单词顺序列
https://www.nowcoder.com/practice/3194a4f4cf814f63919d0790578d51f3?tpId=13&tqId=11197&tPage=3&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking思路...原创 2019-08-21 17:07:36 · 68 阅读 · 0 评论 -
左转字符串
https://www.nowcoder.com/practice/12d959b108cb42b1ab72cef4d36af5ec?tpId=13&tqId=11196&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking思路:先把前n位作为第一...原创 2019-08-21 17:06:58 · 196 阅读 · 0 评论 -
二叉搜索树的后序
https://www.nowcoder.com/practice/a861533d45854474ac791d90e447bafd?tpId=13&tqId=11176&tPage=2&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking...原创 2019-08-21 17:03:24 · 79 阅读 · 0 评论 -
剑指offer 滑动窗口最大值
https://www.nowcoder.com/practice/1624bc35a45c42c0bc17d17fa0cba788?tpId=13&tqId=11217&tPage=4&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking很多...原创 2019-08-21 17:06:51 · 100 阅读 · 0 评论