你我 文明offer bushi

剑指offer_20230803

# 剑指 Offer 51. 数组中的逆序对 ## 题目说明 在数组中的两个数字,如果前面一个数字大于后面的数字,则这两个数字组成一个逆序对。输入一个数组,求出这个数组中的逆序对的总数。 ## 解题思路1:暴力 肯定是可行但是会超时的,就不用考虑了,但理论可行 ## 解题思路2:归并 可以利用归并排 ......
20230803 offer

剑指 Offer 57 - II. 和为s的连续正数序列(简单)

题目: ![](https://img2023.cnblogs.com/blog/2679751/202309/2679751-20230903111447297-1731041087.png) ``` class Solution { public: vector> findContinuousS ......
正数 序列 Offer 57 II

剑指 Offer 39. 数组中出现次数超过一半的数字(简单)

题目: ![](https://img2023.cnblogs.com/blog/2679751/202309/2679751-20230903100813764-1579439104.png) ``` class Solution { public: int majorityElement(vec ......
数组 次数 数字 Offer 39

Leetcode 剑指 Offer 58 - II. 左旋转字符串(Zuo xuan zhuan zi fu chuan lcof)

[题目链接](https://leetcode.cn/problems/zuo-xuan-zhuan-zi-fu-chuan-lcof) 字符串的左旋转操作是把字符串前面的若干个字符转移到字符串的尾部。请定义一个函数实现字符串左旋转操作的功能。比如,输入字符串"abcdefg"和数字2,该函数将返回 ......
左旋 字符串 字符 Leetcode Offer

剑指 Offer 44. 数字序列中某一位的数字(中等)

题目: ![](https://img2023.cnblogs.com/blog/2679751/202309/2679751-20230902204003845-510565441.png) ![](https://img2023.cnblogs.com/blog/2679751/202309/2 ......
数字 序列 Offer 44

剑指 Offer 42. 连续子数组的最大和(简单)

题目: ![](https://img2023.cnblogs.com/blog/2679751/202309/2679751-20230902194907472-1661771290.png) ``` class Solution { public: int maxSubArray(vector& ......
数组 Offer 42

剑指 Offer 14- II. 剪绳子 II(中等)

题目: ![](https://img2023.cnblogs.com/blog/2679751/202309/2679751-20230901202113801-1638700230.png) ``` class Solution { //本题用贪心算法,拆成尽可能多的3且不可以出现长度为1的小段 ......
绳子 Offer 14 II

剑指 Offer 14- I. 剪绳子(中等)

题目: ![](https://img2023.cnblogs.com/blog/2679751/202308/2679751-20230831214433091-1952227654.png) ``` class Solution { public: int cuttingRope(int n) ......
绳子 Offer 14

剑指 Offer 66. 构建乘积数组(中等)

题目: ![](https://img2023.cnblogs.com/blog/2679751/202308/2679751-20230831204134755-955940110.png) ![](https://img2023.cnblogs.com/blog/2679751/202308/2 ......
乘积 数组 Offer 66

剑指 Offer 56 - II. 数组中数字出现的次数 II(中等)

题目: ![](https://img2023.cnblogs.com/blog/2679751/202308/2679751-20230830213756753-635102402.png) ``` class Solution { public: int singleNumber(vector& ......
数组 次数 数字 Offer 56

剑指 Offer 56 - I. 数组中数字出现的次数(中等)

题目: ![](https://img2023.cnblogs.com/blog/2679751/202308/2679751-20230830205030351-137600179.png) ``` class Solution { public: vector singleNumbers(vec ......
数组 次数 数字 Offer 56

iPhone逆向WiFi连接到到手机报错 no matching host key type found. Their offer: ssh-rsa,ssh-dss

报错如下 ssh root@172.31.1.229 Unable to negotiate with 172.31.1.229 port 22: no matching host key type found. Their offer: ssh-rsa,ssh-dss 解决方案 ssh -o Ho ......
ssh matching ssh-rsa ssh-dss iPhone

【剑指Offer】剑指offer题目汇总

# 【剑指Offer】剑指offer题目汇总 本文为《剑指Offer》刷题笔记的总结篇,花了两个多月的时间,将牛客网上《剑指Offer》的66道题刷了一遍,以博客的形式整理了一遍,这66道题属于相对基础的算法题目,对于刷题练手是很好的实践,接下来会继续回到LeetCode,争取每天拿出一个小时,刷一 ......
题目 Offer offer

【剑指Offer】15、反转链表

# 【剑指Offer】15、反转链表 **题目描述:** 输入一个链表,反转链表后,输出新链表的表头。 **解题思路:** 本题比较简单,有两种方法可以实现:(1)三指针。使用三个指针,分别指向当前遍历到的结点、它的前一个结点以及后一个结点。将指针反转后,三个结点依次前移即可。(2)递归方法。同样可 ......
Offer

剑指 Offer 16. 数值的整数次方

根本思想就是二进制能够表示任意类型的数。 class Solution { public: double myPow(double x, int n) { // 为了防止判断n为负数取反时造成溢出 // 用long long 类型接收 long long N = n; // 记录N是否是负数 int ......
整数 数值 Offer 16

剑指 Offer 60. n个骰子的点数(中等)

题目: ![](https://img2023.cnblogs.com/blog/2679751/202308/2679751-20230829220445319-1563934568.png) ``` class Solution { public: vector dicesProbability ......
骰子 点数 Offer 60

剑指Offer 35. 复杂链表的复制

**题目链接:** [剑指Offer 35. 复杂链表的复制](https://leetcode.cn/problems/fu-za-lian-biao-de-fu-zhi-lcof/?envType=study-plan-v2&envId=coding-interviews) **题目描述:** ......
Offer 35

剑指 Offer 49. 丑数(中等)

题目: ![](https://img2023.cnblogs.com/blog/2679751/202308/2679751-20230829204958404-177212521.png) ``` class Solution { public: int nthUglyNumber(int n) ......
Offer 49

Leetcode 剑指Offer 05. 替换空格(Ti huan kong ge lcof)

[题目链接](https://leetcode.cn/problems/ti-huan-kong-ge-lcof) 请实现一个函数,把字符串 s 中的每个空格替换成"%20"。 示例 1: ``` 输入:s = "We are happy." 输出:"We%20are%20happy." ``` 提 ......
空格 Leetcode Offer huan kong

剑指 Offer 19. 正则表达式匹配(困难)

题目: ![](https://img2023.cnblogs.com/blog/2679751/202308/2679751-20230828224953017-382603316.png) ``` class Solution { public: bool isMatch(string s, s ......
正则 表达式 Offer 19

剑指 Offer 10- II. 青蛙跳台阶问题(简单)

题目: ![](https://img2023.cnblogs.com/blog/2679751/202308/2679751-20230828214159429-355812566.png) ``` class Solution { public: int numWays(int n) { vec ......
台阶 青蛙 问题 Offer 10

剑指Offer 34. 二叉树中和为某一值的路径

**题目链接:** [剑指Offer 34. 二叉树中和为某一值的路径](https://leetcode.cn/problems/er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof/?envType=study-plan-v2&envId=codi ......
路径 Offer 34

剑指Offer 33. 二叉搜索树的后序遍历序列

**题目链接:** [剑指Offer 33. 二叉搜索树的后序遍历序列](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/description/?envType=study-plan-v2& ......
序列 Offer 33

剑指Offer 32 - III. 从上到下打印二叉树

**题目链接:** [剑指Offer 32 - III. 从上到下打印二叉树](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof/description/?envType=study-plan-v2& ......
Offer III 32

剑指Offer 32 - II. 从上到下打印二叉树 II

**题目链接:** [剑指Offer 32 - II. 从上到下打印二叉树 II](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof/description/?envType=study-plan-v2 ......
Offer II 32

剑指Offer 31. 栈的压入、弹出序列

**题目链接:** [剑指Offer 31. 栈的压入、弹出序列](https://leetcode.cn/problems/zhan-de-ya-ru-dan-chu-xu-lie-lcof/description/?envType=study-plan-v2&envId=coding-inter ......
序列 Offer 31

剑指 Offer 61. 扑克牌中的顺子(简单)

题目: ![](https://img2023.cnblogs.com/blog/2679751/202308/2679751-20230827203453610-1403573288.png) ``` class Solution { public: bool isStraight(vector& ......
扑克牌 扑克 Offer 61

剑指Offer 32 - I. 从上到下打印二叉树

**题目链接:** [剑指Offer 32 - I. 从上到下打印二叉树](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-lcof/description/?envType=study-plan-v2&envId= ......
Offer 32

剑指 Offer 40. 最小的k个数(简单)

题目: ![](https://img2023.cnblogs.com/blog/2679751/202308/2679751-20230827201039153-650004416.png) ``` class Solution { public: vector getLeastNumbers(v ......
个数 Offer 40

剑指Offer 30. 包含min函数的栈

**题目链接:** [剑指Offer 30. 包含min函数的栈](https://leetcode.cn/problems/bao-han-minhan-shu-de-zhan-lcof/description/?envType=study-plan-v2&envId=coding-intervi ......
函数 Offer min 30