本文相当于目录方便快速检索内容,没有实际内容,只做索引 |
:有此标记的题,表示为经典题,必须优先掌握。要保证看到的一瞬间,无需过脑就能知道如何操作(大概200道左右)。
文章目录
- 一、算法相关
-
- 一、LeetCode
- 二、剑指 Offer
- 三、牛客网
-
一、算法相关
1. 双指针
LeetCode167:两数之和 II - 输入有序数组https://blog.csdn.net/grd_java/article/details/135189006 |
一、LeetCode
LeetCode1:两数之和https://blog.csdn.net/grd_java/article/details/123380577 |
LeetCode2:两数相加https://blog.csdn.net/grd_java/article/details/124421686 |
LeetCode3:无重复字符的最长子串https://blog.csdn.net/grd_java/article/details/124425165 |
LeetCode4:寻找两个正序数组的中位数https://blog.csdn.net/grd_java/article/details/124449745 |
LeetCode5:最长回文子串https://blog.csdn.net/grd_java/article/details/124666706 |
LeetCode6:Z 字形变换https://blog.csdn.net/grd_java/article/details/124668101 |
LeetCode7:整数反转https://blog.csdn.net/grd_java/article/details/124668948 |
LeetCode8:字符串转换整数 (atoi)https://blog.csdn.net/grd_java/article/details/125370327 |
LeetCode9:回文数 https://blog.csdn.net/grd_java/article/details/125370879 |
LeetCode10:正则表达式匹配 https://blog.csdn.net/grd_java/article/details/125472198 |
LeetCode11:盛最多水的容器 https://blog.csdn.net/grd_java/article/details/125472713 |
LeetCode13:罗马数字转整数 https://blog.csdn.net/grd_java/article/details/125487063 |
LeetCode14:最长公共前缀 https://blog.csdn.net/grd_java/article/details/125488765 |
LeetCode20:有效的括号 https://blog.csdn.net/grd_java/article/details/125488801 |
LeetCode26:删除有序数组中的重复项 https://blog.csdn.net/grd_java/article/details/125490478 |
LeetCode27:移除元素https://blog.csdn.net/grd_java/article/details/125491338 |
LeetCode28:实现 strStr()https://blog.csdn.net/grd_java/article/details/125491363 |
LeetCode35:搜索插入位置https://blog.csdn.net/grd_java/article/details/125499608 |
LeetCode53:最大子数组和https://blog.csdn.net/grd_java/article/details/125500916 |
LeetCode58:最后一个单词的长度https://blog.csdn.net/grd_java/article/details/125529993 |
LeetCode66:加一https://blog.csdn.net/grd_java/article/details/125501565 |
LeetCode67:二进制求和https://blog.csdn.net/grd_java/article/details/125503132 |
LeetCode69:x 的平方根https://blog.csdn.net/grd_java/article/details/125511772 |
LeetCode70:爬楼梯https://blog.csdn.net/grd_java/article/details/123336452 |
LeetCode83:删除排序链表中的重复元素https://blog.csdn.net/grd_java/article/details/123842027 |
LeetCode88:合并两个有序数组https://blog.csdn.net/grd_java/article/details/123381676 |
LeetCode94:二叉树的中序遍历https://blog.csdn.net/grd_java/article/details/124409026 |
LeetCode100:相同的树https://blog.csdn.net/grd_java/article/details/125526163 |
LeetCode101:对称二叉树https://blog.csdn.net/grd_java/article/details/125527273 |
LeetCode104:二叉树的最大深度https://blog.csdn.net/grd_java/article/details/125528247 |
LeetCode108:将有序数组转换为二叉搜索树https://blog.csdn.net/grd_java/article/details/125530336 |
LeetCode110:平衡二叉树https://blog.csdn.net/grd_java/article/details/125530702 |
LeetCode111:二叉树的最小深度https://blog.csdn.net/grd_java/article/details/125531251 |
LeetCode112:路径总和https://blog.csdn.net/grd_java/article/details/125533616 |
LeetCode118:杨辉三角https://blog.csdn.net/grd_java/article/details/125534471 |
LeetCode119:杨辉三角 IIhttps://blog.csdn.net/grd_java/article/details/125534694 |
LeetCode121:买卖股票的最佳时机https://blog.csdn.net/grd_java/article/details/125535740 |
LeetCode125:验证回文串https://blog.csdn.net/grd_java/article/details/125652190 |
LeetCode136:只出现一次的数字(位运算异或)https://blog.csdn.net/grd_java/article/details/125652074 |
LeetCode141:环形链表https://blog.csdn.net/grd_java/article/details/123842935 |
LeetCode142:环形链表IIhttps://blog.csdn.net/grd_java/article/details/123843736 |
LeetCode145:二叉树的后序遍历https://blog.csdn.net/grd_java/article/details/125672243 |
LeetCode160:相交链表https://blog.csdn.net/grd_java/article/details/123846514 |
LeetCode168:Excel表列名称https://blog.csdn.net/grd_java/article/details/125648566 |
LeetCode169:多数元素https://blog.csdn.net/grd_java/article/details/125672001 |
LeetCode171:Excel 表列序号https://blog.csdn.net/grd_java/article/details/125725548 |
LeetCode175:组合两个表https://blog.csdn.net/grd_java/article/details/125726134 |
LeetCode181:超过经理收入的员工https://blog.csdn.net/grd_java/article/details/125740609 |
LeetCode182:查找重复的电子邮箱https://blog.csdn.net/grd_java/article/details/125740712 |
LeetCode183:从不订购的客户https://blog.csdn.net/grd_java/article/details/125740832 |
LeetCode190:颠倒二进制位https://blog.csdn.net/grd_java/article/details/125741219 |
LeetCode191:位1的个数(重点,位运算分治典型题)https://blog.csdn.net/grd_java/article/details/125761334 |
LeetCode196:删除重复的电子邮箱https://blog.csdn.net/grd_java/article/details/125763902 |
LeetCode197:上升的温度https://blog.csdn.net/grd_java/article/details/125776316 |
LeetCode202:快乐数https://blog.csdn.net/grd_java/article/details/125780421 |
LeetCode203:移除链表元素https://blog.csdn.net/grd_java/article/details/125780949 |
LeetCode205:同构字符串https://blog.csdn.net/grd_java/article/details/125782797 |
LeetCode206:反转链表https://blog.csdn.net/grd_java/article/details/123850411 |
LeetCode217:存在重复元素https://blog.csdn.net/grd_java/article/details/125909196 |
LeetCode219:存在重复元素 IIhttps://blog.csdn.net/grd_java/article/details/125909236 |
LeetCode225:用队列实现栈https://blog.csdn.net/grd_java/article/details/125910269 |
LeetCode226:翻转二叉树https://blog.csdn.net/grd_java/article/details/125910020 |
LeetCode228:汇总区间https://blog.csdn.net/grd_java/article/details/125911074 |
LeetCode231:2 的幂(位运算,2的幂满足(n & -n) == n; (n & (n-1)) == 0;)https://blog.csdn.net/grd_java/article/details/125972618 |
LeetCode232:用栈实现队列https://blog.csdn.net/grd_java/article/details/124059318 |
LeetCode234:回文链表https://blog.csdn.net/grd_java/article/details/123994522 |
LeetCode235:二叉搜索树的最近公共祖先https://blog.csdn.net/grd_java/article/details/125972778 |
LeetCode283:移动零https://blog.csdn.net/grd_java/article/details/123398610 |
LeetCode303:区域和检索 - 数组不可变https://blog.csdn.net/grd_java/article/details/125457500 |
LeetCode304:二维区域和检索 - 矩阵不可变https://blog.csdn.net/grd_java/article/details/125460190 |
LeetCode394:字符串解码https://blog.csdn.net/grd_java/article/details/124398146 |
LeetCode448:找到所有数组中消失的数字https://blog.csdn.net/grd_java/article/details/123721616 |
LeetCode876:链表的中间结点https://blog.csdn.net/grd_java/article/details/124058409 |
LeetCode1094:拼车https://blog.csdn.net/grd_java/article/details/125462241 |
LeetCode1109:航班预订统计https://blog.csdn.net/grd_java/article/details/125460973 |
LeetCode1854:人口最多的年份https://blog.csdn.net/grd_java/article/details/125462716 |
LeetCode 面试题 16:10. 生存人数https://blog.csdn.net/grd_java/article/details/125455739 |
二、剑指 Offer
剑指 Offer 22. 链表中倒数第k个节点https://blog.csdn.net/grd_java/article/details/124059025 |
剑指 Offer 119:最长连续序列https://blog.csdn.net/grd_java/article/details/125294990 |
三、牛客网
1. 华为机试
HJ1 字符串最后一个单词的长度https://blog.csdn.net/grd_java/article/details/125295816 |
HJ2 计算某字符出现次数https://blog.csdn.net/grd_java/article/details/125295908 |
HJ3 明明的随机数https://blog.csdn.net/grd_java/article/details/125296576 |
HJ4 字符串分隔https://blog.csdn.net/grd_java/article/details/125297454 |
HJ5 进制转换https://blog.csdn.net/grd_java/article/details/125298267 |
HJ6 质数因子https://blog.csdn.net/grd_java/article/details/125298794 |