个人博客目录 比眉伴天荒 2023-06-13 15:29 29阅读 0赞 # Pandas数据分析 # [Task01：Pandas基础][Task01_Pandas] # leetcode算法练习（C++） # * 知识点1：数组 [leetcode 1. 两数之和][leetcode 1.] [leetcode 26. 删除排序数组中的重复项][leetcode 26.] [leetcode 27. 移除元素][leetcode 27.] [leetcode 15. 三数之和][leetcode 15.] [leetcode 16. 最接近的三数之和][leetcode 16.] [leetcode 123. 买卖股票的最佳时机 III][leetcode 123. _ III] * 知识点2：链表 [leetcode 21. 合并两个有序链表][leetcode 21.] [leetcode 83. 删除排序链表中的重复元素][leetcode 83.] [leetcode 141. 环形链表][leetcode 141.] [leetcode 2. 两数相加][leetcode 2.] [leetcode 19. 删除链表的倒数第N个节点][leetcode 19. _N] [leetcode 23. 合并K个排序链表][leetcode 23. _K] * 知识点3：字符串 [leetcode 13. 罗马数字转整数][leetcode 13.] [leetcode 14. 最长公共前缀][leetcode 14.] [leetcode 20. 有效的括号][leetcode 20.] [leetcode 3. 无重复字符的最长子串][leetcode 3.] [leetcode 5. 最长回文子串][leetcode 5.] [leetcode 10. 正则表达式匹配][leetcode 10.] * 知识点4：树 [leetcode 100. 相同的树][leetcode 100.] [leetcode 101. 对称二叉树][leetcode 101.] [leetcode 104. 二叉树的最大深度][leetcode 104.] [leetcode 94. 二叉树的中序遍历][leetcode 94.] [leetcode 95. 不同的二叉搜索树 II][leetcode 95. _ II] [leetcode 99. 恢复二叉搜索树][leetcode 99.] * 知识点5：贪心算法 [leetcode 122. 买卖股票的最佳时机 II][leetcode 122. _ II] [leetcode 392. 判断子序列][leetcode 392.] [leetcode 455. 分发饼干][leetcode 455.] [leetcode 55. 跳跃游戏][leetcode 55.] [leetcode 134. 加油站][leetcode 134.] [leetcode 44. 通配符匹配][leetcode 44.] # opencv基础入门 # 1. [环境搭建与基础操作][Link 1] 2. [色彩空间][Link 2] 3. [像素运算][Link 3] 4. [ROI与泛洪填充][ROI] 5. [模糊操作][Link 4] # “机器学习实战”刻意练习 # 1. [分类问题：K近邻算法][K] 2. [分类问题：决策树][Link 5] 3. [分类问题：朴素贝叶斯][Link 6] 4. [分类问题：逻辑(Logistic)回归][Logistic] 5. [分类问题：支持向量机(SVM)][SVM] 6. [分类问题：AdaBoost][AdaBoost] 7. [回归问题：线性回归(最小二乘、岭回归、逐步回归)][Link 7] 8. [聚类问题：K均值聚类][K 1] 9. [相关问题：Apriori][Apriori] # python基础刻意练习 # 1. [Day1:变量、运算符与数据类型][Day1] 2. [Day2:条件与循环][Day2] 3. [Day3&4:列表与元组][Day3_4] 4. [Day5:字符串与序列][Day5] 5. [Day6&7:函数与Lambda表达式][Day6_7_Lambda] 6. [Day8:字典与集合][Day8] 7. [Day9&10:文件与文件系统][Day9_10] 8. [Day11:异常处理][Day11] 9. [Day12:else 与 with 语句][Day12_else _ with] 10. [Day13&14:类与对象][Day13_14] 11. [Day15&16:魔法方法][Day15_16] 12. [Day17:模块][Day17] # leetcode刷题(python) # [02：两数相加][02] [04：寻找两个有序数组的中位数][04] [05：最长回文子串][05] [07：整数反转][07] [08：字符串转换整数 (atoi)][08_ _atoi] [09：回文数][09] [11：盛最多水的容器][11] [14：最长公共前缀][14] [15：三数之和][15] [16：最接近的三数之和][16] [20：有效的括号][20] [21：合并两个有序链表][21] [23：合并 k 个排序链表][23_ k] [26：删除排序数组中的重复项][26] [33：搜索旋转排序数组][33] [43：字符串相乘][43] [46：全排列][46] [53：最大子序和][53] [54：螺旋矩阵][54] [59：螺旋矩阵 II][59_ II] [61：旋转链表][61] [62：不同路径][62] [70：爬楼梯][70] [78：子集][78] [88：合并两个有序数组][88] [89：格雷编码][89] [104：二叉树的最大深度][104] [121：买卖股票的最佳时机][121] [122：买卖股票的最佳时机 II][122_ II] [124：二叉树中的最大路径和][124] [136:只出现一次的数字][136] [141：环形链表][141] [142： 环形链表 II][142_ _ II] [146：LRU缓存机制][146_LRU] [148：排序链表][148] [155： 最小栈][155_] [160：相交链表][160] [169：求众数][169] [206：反转链表][206] [215：数组中的第K个最大元素][215_K] [217：存在重复元素][217] [230：二叉搜索树中第K小的元素][230_K] [231：2的幂][231_2] [235：二叉搜索树的最近公共祖先][235] [236：二叉树的最近公共祖先][236] [237：删除链表中的节点][237] [238：除自身以外数组的乘积][238] [292：Nim 游戏][292_Nim] [344：反转字符串][344] [557：反转字符串中的单词 III][557_ III] # 编程实现线性规划 # 1. [单纯形法（上）][Link 8] 2. [单纯形法（下）][Link 9] # 数据结构 # 1. [图结构——图的遍历][Link 10] 2. [图结构——最小生成树][Link 11] # 算法导论相关 # 1. [part1.基础知识（伪代码、时间复杂度、渐进记号）][part1.] 2. [part1.基础知识（递归式、概率）][part1. 1] 3. [part2.排序(插入排序、冒泡排序、选择排序)][part2.] 4. [part2.排序（堆排序、快速排序）][part2. 1] [Task01_Pandas]: https://blog.csdn.net/nanashi_F/article/details/105639370 [leetcode 1.]: https://blog.csdn.net/nanashi_F/article/details/104584739 [leetcode 26.]: https://blog.csdn.net/nanashi_F/article/details/104600876 [leetcode 27.]: https://blog.csdn.net/nanashi_F/article/details/104618208 [leetcode 15.]: https://blog.csdn.net/nanashi_F/article/details/104643563 [leetcode 16.]: https://blog.csdn.net/nanashi_F/article/details/104663521 [leetcode 123. _ III]: https://blog.csdn.net/nanashi_F/article/details/104670584 [leetcode 21.]: https://blog.csdn.net/nanashi_F/article/details/104700670 [leetcode 83.]: https://blog.csdn.net/nanashi_F/article/details/104715971 [leetcode 141.]: https://blog.csdn.net/nanashi_F/article/details/104739893 [leetcode 2.]: https://blog.csdn.net/nanashi_F/article/details/104743442 [leetcode 19. _N]: https://blog.csdn.net/nanashi_F/article/details/104755208 [leetcode 23. _K]: https://blog.csdn.net/nanashi_F/article/details/104764743 [leetcode 13.]: https://blog.csdn.net/nanashi_F/article/details/104829328 [leetcode 14.]: https://blog.csdn.net/nanashi_F/article/details/104843381 [leetcode 20.]: https://blog.csdn.net/nanashi_F/article/details/104882332 [leetcode 3.]: https://blog.csdn.net/nanashi_F/article/details/104892894 [leetcode 5.]: https://blog.csdn.net/nanashi_F/article/details/104927336 [leetcode 10.]: https://blog.csdn.net/nanashi_F/article/details/104952369 [leetcode 100.]: https://blog.csdn.net/nanashi_F/article/details/104973902 [leetcode 101.]: https://blog.csdn.net/nanashi_F/article/details/104987452 [leetcode 104.]: https://blog.csdn.net/nanashi_F/article/details/105009872 [leetcode 94.]: https://blog.csdn.net/nanashi_F/article/details/105021223 [leetcode 95. _ II]: https://blog.csdn.net/nanashi_F/article/details/105049316 [leetcode 99.]: https://blog.csdn.net/nanashi_F/article/details/105078855 [leetcode 122. _ II]: https://blog.csdn.net/nanashi_F/article/details/105102847 [leetcode 392.]: https://blog.csdn.net/nanashi_F/article/details/105108365 [leetcode 455.]: https://blog.csdn.net/nanashi_F/article/details/105144695 [leetcode 55.]: https://blog.csdn.net/nanashi_F/article/details/105151613 [leetcode 134.]: https://blog.csdn.net/nanashi_F/article/details/105159587 [leetcode 44.]: https://blog.csdn.net/nanashi_F/article/details/105165065 [Link 1]: https://blog.csdn.net/nanashi_F/article/details/103656205 [Link 2]: https://blog.csdn.net/nanashi_F/article/details/103663583 [Link 3]: https://blog.csdn.net/nanashi_F/article/details/103690065 [ROI]: https://blog.csdn.net/nanashi_F/article/details/103695624 [Link 4]: https://blog.csdn.net/nanashi_F/article/details/103702970 [K]: https://blog.csdn.net/nanashi_F/article/details/102988924 [Link 5]: https://blog.csdn.net/nanashi_F/article/details/103035620 [Link 6]: https://blog.csdn.net/nanashi_F/article/details/103116550 [Logistic]: https://blog.csdn.net/nanashi_F/article/details/103190597 [SVM]: https://blog.csdn.net/nanashi_F/article/details/103313179 [AdaBoost]: https://blog.csdn.net/nanashi_F/article/details/103354109 [Link 7]: https://blog.csdn.net/nanashi_F/article/details/103532815 [K 1]: https://blog.csdn.net/nanashi_F/article/details/103629718 [Apriori]: https://blog.csdn.net/nanashi_F/article/details/103641686 [Day1]: https://blog.csdn.net/nanashi_F/article/details/102576036 [Day2]: https://blog.csdn.net/nanashi_F/article/details/102576205 [Day3_4]: https://blog.csdn.net/nanashi_F/article/details/102576336 [Day5]: https://blog.csdn.net/nanashi_F/article/details/102576606 [Day6_7_Lambda]: https://blog.csdn.net/nanashi_F/article/details/102728193 [Day8]: https://blog.csdn.net/nanashi_F/article/details/102738525 [Day9_10]: https://blog.csdn.net/nanashi_F/article/details/102746726 [Day11]: https://blog.csdn.net/nanashi_F/article/details/102788316 [Day12_else _ with]: https://blog.csdn.net/nanashi_F/article/details/102763810 [Day13_14]: https://blog.csdn.net/nanashi_F/article/details/102827027 [Day15_16]: https://blog.csdn.net/nanashi_F/article/details/102870209 [Day17]: https://blog.csdn.net/nanashi_F/article/details/102873502 [02]: https://blog.csdn.net/nanashi_F/article/details/100071067 [04]: https://blog.csdn.net/nanashi_F/article/details/100083180 [05]: https://blog.csdn.net/nanashi_F/article/details/100111888 [07]: https://blog.csdn.net/nanashi_F/article/details/100127771 [08_ _atoi]: https://blog.csdn.net/nanashi_F/article/details/100134216 [09]: https://blog.csdn.net/nanashi_F/article/details/100164134 [11]: https://blog.csdn.net/nanashi_F/article/details/100165016 [14]: https://blog.csdn.net/nanashi_F/article/details/100166178 [15]: https://blog.csdn.net/nanashi_F/article/details/100166194 [16]: https://blog.csdn.net/nanashi_F/article/details/100169350 [20]: https://blog.csdn.net/nanashi_F/article/details/100169366 [21]: https://blog.csdn.net/nanashi_F/article/details/100169375 [23_ k]: https://blog.csdn.net/nanashi_F/article/details/100519602 [26]: https://blog.csdn.net/nanashi_F/article/details/100519635 [33]: https://blog.csdn.net/nanashi_F/article/details/100519665 [43]: https://blog.csdn.net/nanashi_F/article/details/100603067 [46]: https://blog.csdn.net/nanashi_F/article/details/100603087 [53]: https://blog.csdn.net/nanashi_F/article/details/100603102 [54]: https://blog.csdn.net/nanashi_F/article/details/100603125 [59_ II]: https://blog.csdn.net/nanashi_F/article/details/100603142 [61]: https://blog.csdn.net/nanashi_F/article/details/100783762 [62]: https://blog.csdn.net/nanashi_F/article/details/100783724 [70]: https://blog.csdn.net/nanashi_F/article/details/100783782 [78]: https://blog.csdn.net/nanashi_F/article/details/100783799 [88]: https://blog.csdn.net/nanashi_F/article/details/100783826 [89]: https://blog.csdn.net/nanashi_F/article/details/100992798 [104]: https://blog.csdn.net/nanashi_F/article/details/100992830 [121]: https://blog.csdn.net/nanashi_F/article/details/100992860 [122_ II]: https://blog.csdn.net/nanashi_F/article/details/100992881 [124]: https://blog.csdn.net/nanashi_F/article/details/101160128 [136]: https://blog.csdn.net/nanashi_F/article/details/101160171 [141]: https://blog.csdn.net/nanashi_F/article/details/101160197 [142_ _ II]: https://blog.csdn.net/nanashi_F/article/details/101160206 [146_LRU]: https://blog.csdn.net/nanashi_F/article/details/101268455 [148]: https://blog.csdn.net/nanashi_F/article/details/101268488 [155_]: https://blog.csdn.net/nanashi_F/article/details/101268527 [160]: https://blog.csdn.net/nanashi_F/article/details/101268568 [169]: https://blog.csdn.net/nanashi_F/article/details/101268609 [206]: https://blog.csdn.net/nanashi_F/article/details/101870357 [215_K]: https://blog.csdn.net/nanashi_F/article/details/101870400 [217]: https://blog.csdn.net/nanashi_F/article/details/101870421 [230_K]: https://blog.csdn.net/nanashi_F/article/details/102023033 [231_2]: https://blog.csdn.net/nanashi_F/article/details/102146820 [235]: https://blog.csdn.net/nanashi_F/article/details/102147383 [236]: https://blog.csdn.net/nanashi_F/article/details/102154631 [237]: https://blog.csdn.net/nanashi_F/article/details/102231179 [238]: https://blog.csdn.net/nanashi_F/article/details/102233320 [292_Nim]: https://blog.csdn.net/nanashi_F/article/details/102233693 [344]: https://blog.csdn.net/nanashi_F/article/details/102235407 [557_ III]: https://blog.csdn.net/nanashi_F/article/details/102398287 [Link 8]: https://blog.csdn.net/nanashi_F/article/details/95891827 [Link 9]: https://blog.csdn.net/nanashi_F/article/details/97612062 [Link 10]: https://blog.csdn.net/nanashi_F/article/details/92219999 [Link 11]: https://blog.csdn.net/nanashi_F/article/details/91960357 [part1.]: https://blog.csdn.net/nanashi_F/article/details/88769527 [part1. 1]: https://blog.csdn.net/nanashi_F/article/details/88776577 [part2.]: https://blog.csdn.net/nanashi_F/article/details/88902072 [part2. 1]: https://blog.csdn.net/nanashi_F/article/details/89072910
相关 个人博客系统 目 录 摘 要 ABSTRACT 目 录 第1章 绪论 1.1背景及意义 1.2 研究现状 2 1.3 研究意义 3 第2章 相关技术 4 2.1 系统开 短命女/ 2023年10月03日 20:16/ 0 赞/ 103 阅读
相关 个人博客目录 Pandas数据分析 [Task01：Pandas基础][Task01_Pandas] leetcode算法练习（C++） 知识点1：数组 [l 比眉伴天荒/ 2023年06月13日 15:29/ 0 赞/ 30 阅读
相关 数据结构 个人博客目录 前言 因为要考研，所以在复习数据结构这本书的同时，写下这些东西，一方面是总结总结知识，顺便分享一下自己的理解。本人菜鸡一个，可能有些东西会说错，望见谅，指正一下，也算帮我 深碍√TFBOYSˉ_/ 2023年03月03日 08:50/ 0 赞/ 205 阅读
相关 个人博客地址 gitee:[Bin的博客![icon-default.png_t_L892][]https://hicb.gitee.io/][Bin_icon-default.png_t 我会带着你远行/ 2022年09月12日 01:53/ 0 赞/ 348 阅读
相关 博客目录 [数据库连接串总结网址][Link 1] [Xtreme Toolkit Pro v11.2.1 汉化全过程(文章收藏)][Xtreme Toolkit Pro v11.2. 水深无声/ 2022年08月03日 23:47/ 0 赞/ 318 阅读
相关 博客目录 R语言学习笔记 R实现机器学习 [R机器学习（一）——一元回归][R] [R机器学习（二）——非线性回归][R 1] [R机器学习（三）——多元回归][R 2] 布满荆棘的人生/ 2022年06月09日 11:17/ 0 赞/ 336 阅读
相关 博客目录 更新日期：2021-02-25 [Linux学习笔记][Linux] 简介：Linux常用命令、管道与重定向、vim与shell脚本、流程控制 [R语 墨蓝/ 2022年05月26日 03:50/ 0 赞/ 293 阅读
相关 博客目录 python 基础 [pyenv 安装使用记录][pyenv] [python 基础 01][python _ 01] [python 基础 02][python _ Myth丶恋晨/ 2022年01月11日 08:29/ 0 赞/ 371 阅读
相关 博客目录 [一、Python基础目录][Python] [二、MySQL目录][MySQL] [三、Web前端目录][Web] [四、Django目录][Django] [五、L 布满荆棘的人生/ 2021年10月19日 00:52/ 0 赞/ 492 阅读
短命女
我会带着你远行
Myth丶恋晨
灰太狼
还没有评论，来说两句吧...