面试题目:100道经典的热门算法题目.zip

上传者: m0_46013789 | 上传时间: 2024-11-05 13:51:17 | 文件大小: 157KB | 文件类型: ZIP
1.介绍:面试题目:100道经典的热门算法题目.zip 2.资源内容:面试题目:100道经典的热门算法题目.zip 3.适用人群:计算机,电子信息工程、数学等专业的大学生课程设计、期末大作业或毕业设计,作为“参考资料”使用。 4、作者介绍:某大厂资深算法工程师,从事Matlab、Python、C/C++、Java、YOLO算法仿真工作10年;路径规划、擅长计算机视觉、目标检测模型、智能优化算法、神经网络预测、信号处理、元胞自动机、图像处理、智能控制、无人机等多种领域的算法仿真实验。

文件下载

资源详情

[{"title":"( 151 个子文件 157KB ) 面试题目:100道经典的热门算法题目.zip","children":[{"title":"你玩过“拉灯”游戏吗?.md <span style='color:#111;'> 5.25KB </span>","children":null,"spread":false},{"title":"袭击.md <span style='color:#111;'> 5.08KB </span>","children":null,"spread":false},{"title":"蚯蚓.md <span style='color:#111;'> 4.62KB </span>","children":null,"spread":false},{"title":"后缀数组.md <span style='color:#111;'> 3.60KB </span>","children":null,"spread":false},{"title":"防线.md <span style='color:#111;'> 3.58KB </span>","children":null,"spread":false},{"title":"数据备份.md <span style='color:#111;'> 3.57KB </span>","children":null,"spread":false},{"title":"电影.md <span style='color:#111;'> 3.50KB </span>","children":null,"spread":false},{"title":"是否存在两片形状相同的雪花_.md <span style='color:#111;'> 3.24KB </span>","children":null,"spread":false},{"title":"占卜DIY .md <span style='color:#111;'> 3.20KB </span>","children":null,"spread":false},{"title":"编辑器.md <span style='color:#111;'> 3.15KB </span>","children":null,"spread":false},{"title":"数的进制转换.md <span style='color:#111;'> 3.13KB </span>","children":null,"spread":false},{"title":"火车进出栈问题.md <span style='color:#111;'> 3.02KB </span>","children":null,"spread":false},{"title":"赶牛入圈.md <span style='color:#111;'> 2.98KB </span>","children":null,"spread":false},{"title":"七夕祭.md <span style='color:#111;'> 2.96KB </span>","children":null,"spread":false},{"title":"荷马史诗.md <span style='color:#111;'> 2.96KB </span>","children":null,"spread":false},{"title":"天才ACM.md <span style='color:#111;'> 2.94KB </span>","children":null,"spread":false},{"title":"小组队列.md <span style='color:#111;'> 2.93KB </span>","children":null,"spread":false},{"title":"国王游戏.md <span style='color:#111;'> 2.88KB </span>","children":null,"spread":false},{"title":"奇数码问题.md <span style='color:#111;'> 2.88KB </span>","children":null,"spread":false},{"title":"飞行员兄弟.md <span style='color:#111;'> 2.71KB </span>","children":null,"spread":false},{"title":"动态中位数.md <span style='color:#111;'> 2.64KB </span>","children":null,"spread":false},{"title":"分形.md <span style='color:#111;'> 2.58KB </span>","children":null,"spread":false},{"title":"任务.md <span style='color:#111;'> 2.54KB </span>","children":null,"spread":false},{"title":"最长异或值路径.md <span style='color:#111;'> 2.50KB </span>","children":null,"spread":false},{"title":"序列.md <span style='color:#111;'> 2.43KB </span>","children":null,"spread":false},{"title":"有依赖的背包问题.md <span style='color:#111;'> 2.43KB </span>","children":null,"spread":false},{"title":"给树染色.md <span style='color:#111;'> 2.33KB </span>","children":null,"spread":false},{"title":"直方图中最大的矩形.md <span style='color:#111;'> 2.33KB </span>","children":null,"spread":false},{"title":"分形之城..md <span style='color:#111;'> 2.30KB </span>","children":null,"spread":false},{"title":"激光炸弹.md <span style='color:#111;'> 2.30KB </span>","children":null,"spread":false},{"title":"合并果子.md <span style='color:#111;'> 2.09KB </span>","children":null,"spread":false},{"title":"畜栏预定.md <span style='color:#111;'> 2.05KB </span>","children":null,"spread":false},{"title":"回文子串的最大长度.md <span style='color:#111;'> 2.03KB </span>","children":null,"spread":false},{"title":"背包问题求具体方案.md <span style='color:#111;'> 1.96KB </span>","children":null,"spread":false},{"title":"周期.md <span style='color:#111;'> 1.96KB </span>","children":null,"spread":false},{"title":"火车进栈.md <span style='color:#111;'> 1.96KB </span>","children":null,"spread":false},{"title":"双端队列.md <span style='color:#111;'> 1.94KB </span>","children":null,"spread":false},{"title":"雷达设备 .md <span style='color:#111;'> 1.91KB </span>","children":null,"spread":false},{"title":"最短Hamilton路径.md <span style='color:#111;'> 1.88KB </span>","children":null,"spread":false},{"title":"最大的和.md <span style='color:#111;'> 1.84KB </span>","children":null,"spread":false},{"title":"防晒.md <span style='color:#111;'> 1.83KB </span>","children":null,"spread":false},{"title":"耍杂技的牛.md <span style='color:#111;'> 1.82KB </span>","children":null,"spread":false},{"title":"兔子与兔子.md <span style='color:#111;'> 1.81KB </span>","children":null,"spread":false},{"title":"邻值查找.md <span style='color:#111;'> 1.79KB </span>","children":null,"spread":false},{"title":"超快速排序.md <span style='color:#111;'> 1.78KB </span>","children":null,"spread":false},{"title":"超市.md <span style='color:#111;'> 1.78KB </span>","children":null,"spread":false},{"title":"最高的牛.md <span style='color:#111;'> 1.77KB </span>","children":null,"spread":false},{"title":"用两个栈实现队列.md <span style='color:#111;'> 1.76KB </span>","children":null,"spread":false},{"title":"最大异或对.md <span style='color:#111;'> 1.75KB </span>","children":null,"spread":false},{"title":"表示数值的字符串.md <span style='color:#111;'> 1.73KB </span>","children":null,"spread":false},{"title":"序列化二叉树.md <span style='color:#111;'> 1.73KB </span>","children":null,"spread":false},{"title":"机器人的运动范围.md <span style='color:#111;'> 1.72KB </span>","children":null,"spread":false},{"title":"最佳牛围栏.md <span style='color:#111;'> 1.68KB </span>","children":null,"spread":false},{"title":"之字形打印二叉树.md <span style='color:#111;'> 1.66KB </span>","children":null,"spread":false},{"title":"约数之和.md <span style='color:#111;'> 1.65KB </span>","children":null,"spread":false},{"title":"括号画家.md <span style='color:#111;'> 1.65KB </span>","children":null,"spread":false},{"title":"士兵.md <span style='color:#111;'> 1.65KB </span>","children":null,"spread":false},{"title":"前缀统计.md <span style='color:#111;'> 1.61KB </span>","children":null,"spread":false},{"title":"A + B.md <span style='color:#111;'> 1.59KB </span>","children":null,"spread":false},{"title":"特殊排序.md <span style='color:#111;'> 1.57KB </span>","children":null,"spread":false},{"title":"分组背包问题.md <span style='color:#111;'> 1.53KB </span>","children":null,"spread":false},{"title":"矩阵中的路径.md <span style='color:#111;'> 1.50KB </span>","children":null,"spread":false},{"title":"背包问题求方案数.md <span style='color:#111;'> 1.50KB </span>","children":null,"spread":false},{"title":"奇怪的汉诺塔.md <span style='color:#111;'> 1.42KB </span>","children":null,"spread":false},{"title":"骰子的点数.md <span style='color:#111;'> 1.38KB </span>","children":null,"spread":false},{"title":"数据流中的中位数.md <span style='color:#111;'> 1.34KB </span>","children":null,"spread":false},{"title":"二叉树中和为某一值的路径.md <span style='color:#111;'> 1.32KB </span>","children":null,"spread":false},{"title":"重建二叉树.md <span style='color:#111;'> 1.30KB </span>","children":null,"spread":false},{"title":"对称的二叉树.md <span style='color:#111;'> 1.30KB </span>","children":null,"spread":false},{"title":"把字符串转换成整数.md <span style='color:#111;'> 1.30KB </span>","children":null,"spread":false},{"title":"递归实现组合型枚举.md <span style='color:#111;'> 1.29KB </span>","children":null,"spread":false},{"title":"翻转单词顺序.md <span style='color:#111;'> 1.29KB </span>","children":null,"spread":false},{"title":"增减序列.md <span style='color:#111;'> 1.28KB </span>","children":null,"spread":false},{"title":"链表中环的入口结点.md <span style='color:#111;'> 1.28KB </span>","children":null,"spread":false},{"title":"最大子序和.md <span style='color:#111;'> 1.28KB </span>","children":null,"spread":false},{"title":"字符流中第一个只出现一次的字符(1).md <span style='color:#111;'> 1.23KB </span>","children":null,"spread":false},{"title":"分行从上往下打印二叉树.md <span style='color:#111;'> 1.22KB </span>","children":null,"spread":false},{"title":"数字序列中某一位的数字.md <span style='color:#111;'> 1.20KB </span>","children":null,"spread":false},{"title":"包含min函数的栈.md <span style='color:#111;'> 1.20KB </span>","children":null,"spread":false},{"title":"递归实现排列型枚举.md <span style='color:#111;'> 1.20KB </span>","children":null,"spread":false},{"title":"判断该树是不是平衡二叉树.md <span style='color:#111;'> 1.16KB </span>","children":null,"spread":false},{"title":"正则表达式匹配.md <span style='color:#111;'> 1.15KB </span>","children":null,"spread":false},{"title":"数字排列.md <span style='color:#111;'> 1.13KB </span>","children":null,"spread":false},{"title":"从1到n整数中1出现的次数.md <span style='color:#111;'> 1.12KB </span>","children":null,"spread":false},{"title":"栈的压入、弹出序列.md <span style='color:#111;'> 1.10KB </span>","children":null,"spread":false},{"title":"糖果传递.md <span style='color:#111;'> 1.08KB </span>","children":null,"spread":false},{"title":"混合背包问题.md <span style='color:#111;'> 1.07KB </span>","children":null,"spread":false},{"title":"扑克牌的顺子.md <span style='color:#111;'> 1.05KB </span>","children":null,"spread":false},{"title":"树中两个结点的最低公共祖先.md <span style='color:#111;'> 1.04KB </span>","children":null,"spread":false},{"title":"和为S的连续正数序列.md <span style='color:#111;'> 1.04KB </span>","children":null,"spread":false},{"title":"二叉搜索树与双向链表.md <span style='color:#111;'> 1.03KB </span>","children":null,"spread":false},{"title":"二叉树的下一个节点.md <span style='color:#111;'> 1.02KB </span>","children":null,"spread":false},{"title":"递归实现指数型枚举 .md <span style='color:#111;'> 1.01KB </span>","children":null,"spread":false},{"title":"树的子结构.md <span style='color:#111;'> 1022B </span>","children":null,"spread":false},{"title":"滑动窗口的最大值.md <span style='color:#111;'> 1017B </span>","children":null,"spread":false},{"title":"顺时针打印矩阵.md <span style='color:#111;'> 999B </span>","children":null,"spread":false},{"title":"多重背包问题 III.md <span style='color:#111;'> 987B </span>","children":null,"spread":false},{"title":"货仓选址.md <span style='color:#111;'> 977B </span>","children":null,"spread":false},{"title":"礼物的最大价值.md <span style='color:#111;'> 950B </span>","children":null,"spread":false},{"title":"两个链表的第一个公共结点.md <span style='color:#111;'> 948B </span>","children":null,"spread":false},{"title":"......","children":null,"spread":false},{"title":"<span style='color:steelblue;'>文件过多,未全部展示</span>","children":null,"spread":false}],"spread":true}]

评论信息

免责申明

【只为小站】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【只为小站】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,zhiweidada#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明