华为OD机试（A卷 + B卷 + C卷）按算法考点分类

向右看齐 2024-04-20 12:28 53阅读 0赞

本专栏收录于[《华为OD机试（JAVA）真题（A卷+B卷+C卷）》][OD_JAVA_A_B_C]。

**刷的越多，抽中的概率越大**，每一题都有详细的答题思路、详细的代码注释、样例测试，订阅后，专栏内的文章都可看，可加入华为OD刷题群（私信即可），发现新题目，随时更新，全天CSDN在线答疑。

2023年11月份，华为官方已经将华为OD机试（A卷/B卷）切换为 C卷/D卷。

目前正在考的是C卷，按照华为OD往常的操作，C卷题目是由往年真题（A卷/B卷）+全新题目组成，也就是说C卷和D卷还会考到A卷和B卷的题目的，比例大概是1道新题、2道旧题的样子。

**2023年11月份之后，很多小伙伴收到的是C卷，那么恭喜你看到本文了，抓紧刷题吧。C卷新题库正在更新中**。

**华为机试有三道题，第一道和第二道属于简单题，分值为100分，第三道为困难题，分值为200分，总分400分，150分钟考试时间**。

#### 一、逻辑分析 ####

#### 二、字符串 ####

#### 三、数据结构 ####

<table> 
 <thead> 
  <tr> 
   <th>题目</th> 
   <th>考点</th> 
   <th>考卷</th> 
   <th>分值</th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/130938033" rel="nofollow">IPv4地址转换成整数</a></td> 
   <td>数组</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/132255331" rel="nofollow">数组去重和排序</a></td> 
   <td>map与list</td> 
   <td>C卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/136640221" rel="nofollow">垃圾信息拦截</a></td> 
   <td>map与list</td> 
   <td>C卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/132197477" rel="nofollow">简易内存池</a></td> 
   <td>map与list</td> 
   <td>B卷</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/131735787" rel="nofollow">路灯照明问题</a></td> 
   <td>map与list</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/132265176" rel="nofollow">最大N个数与最小N个数的和</a></td> 
   <td>map与list</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/132359451" rel="nofollow">全量和已占用字符集</a></td> 
   <td>map与list</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/131906923" rel="nofollow">告警抑制</a></td> 
   <td>map与list</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/131995644" rel="nofollow">报文回路</a></td> 
   <td>map与list</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/130651910" rel="nofollow">异常的打卡记录</a></td> 
   <td>map与list</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/134317002" rel="nofollow">最优策略组合下的总的系统消耗资源数</a></td> 
   <td>map与list</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/132093601" rel="nofollow">城市聚集度</a></td> 
   <td>map与list</td> 
   <td>B卷</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/133788190" rel="nofollow">最长的顺子</a></td> 
   <td>map与list</td> 
   <td>B卷</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/136688481" rel="nofollow">打印任务排序</a></td> 
   <td>队列</td> 
   <td>C卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/130957580" rel="nofollow">寻找密码</a></td> 
   <td>优先队列</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/131020216" rel="nofollow">支持优先级的队列</a></td> 
   <td>优先队列</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/131886137" rel="nofollow">模拟消息队列</a></td> 
   <td>队列</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/132524430" rel="nofollow">最差产品奖</a></td> 
   <td>双端队列</td> 
   <td>B卷</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/130659356" rel="nofollow">统一限载货物数最小值</a></td> 
   <td>队列</td> 
   <td>B卷</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/132940377" rel="nofollow">特异性双端队列</a></td> 
   <td>链表</td> 
   <td>C卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/130945764" rel="nofollow">输出单向链表中倒数第k个结点</a></td> 
   <td>链表</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/133766360" rel="nofollow">最大括号深度</a></td> 
   <td>栈</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/133658829" rel="nofollow">消消乐游戏</a></td> 
   <td>栈</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/130959598" rel="nofollow">分奖金</a></td> 
   <td>栈</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/132112650" rel="nofollow">荒岛求生</a></td> 
   <td>栈</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/132052320" rel="nofollow">阿里巴巴找黄金宝箱(IV)</a></td> 
   <td>栈</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/130946065" rel="nofollow">二叉树的所有路径</a></td> 
   <td>栈</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/130892757" rel="nofollow">简单的解压缩算法</a></td> 
   <td>栈</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
 </tbody> 
</table>

#### 四、双指针 ####

<table> 
 <thead> 
  <tr> 
   <th>题目</th> 
   <th>考点</th> 
   <th>考卷</th> 
   <th>分值</th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/131623738" rel="nofollow">阿里巴巴找黄金宝箱(I)</a></td> 
   <td>单指针</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/137125845" rel="nofollow">绘图机器</a></td> 
   <td>双指针</td> 
   <td>C卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/133062757" rel="nofollow">求最多可以派出多少支团队</a></td> 
   <td>双指针</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/132946922" rel="nofollow">工号不够用了怎么办</a></td> 
   <td>双指针</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/133659015" rel="nofollow">寻找身高相近的小朋友</a></td> 
   <td>双指针</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/132261853" rel="nofollow">最长连续子序列</a></td> 
   <td>双指针</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/132393257" rel="nofollow">考勤信息</a></td> 
   <td>双指针</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/132526466" rel="nofollow">求满足条件的最长子串的长度</a></td> 
   <td>双指针</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/131623738" rel="nofollow">阿里巴巴找黄金宝箱(I)</a></td> 
   <td>双指针</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/131196164" rel="nofollow">非严格递增连续数字序列</a></td> 
   <td>双指针</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/130938848" rel="nofollow">太阳能板最大面积</a></td> 
   <td>双指针</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/133808365" rel="nofollow">叠积木1</a></td> 
   <td>双指针</td> 
   <td>B卷</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/137607740" rel="nofollow">数组连续和</a></td> 
   <td>滑动窗口</td> 
   <td>C卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/131806337" rel="nofollow">最左侧冗余覆盖子串</a></td> 
   <td>滑动窗口</td> 
   <td>C卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/131739206" rel="nofollow">找出通过车辆最多颜色</a></td> 
   <td>滑动窗口</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/131742889" rel="nofollow">计算最接近的数</a></td> 
   <td>滑动窗口</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/133710912" rel="nofollow">用连续自然数之和来表达整数</a></td> 
   <td>滑动窗口</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/133956316" rel="nofollow">滑动窗口最大和</a></td> 
   <td>滑动窗口</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/132947931" rel="nofollow">关联子串</a></td> 
   <td>滑动窗口</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/131624189" rel="nofollow">补种未成活胡杨</a></td> 
   <td>滑动窗口</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/130783089" rel="nofollow">最大花费金额</a></td> 
   <td>滑动窗口</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/131138776" rel="nofollow">高矮个子排队</a></td> 
   <td>滑动窗口</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/131118000" rel="nofollow">观看文艺汇演问题</a></td> 
   <td>滑动窗口</td> 
   <td>B卷</td> 
   <td>200</td> 
  </tr> 
 </tbody> 
</table>

#### 五、矩阵、二叉树 ####

#### 六、贪心思维 ####

#### 七、二分查找 ####

#### 八、回溯 ####

#### 九、排列 ####

#### 十、正则表达式 ####

#### 十一、深度优先搜索DFS ####

<table> 
 <thead> 
  <tr> 
   <th>题目</th> 
   <th>考点</th> 
   <th>考卷</th> 
   <th>分值</th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/137028911" rel="nofollow">项目规划</a></td> 
   <td>深度优先搜索DFS</td> 
   <td>C卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/136467817" rel="nofollow">数字排列</a></td> 
   <td>深度优先搜索DFS</td> 
   <td>C卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/130901107" rel="nofollow">猜密码</a></td> 
   <td>深度优先搜索DFS</td> 
   <td>C卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/132462934" rel="nofollow">过滤组合字符串</a></td> 
   <td>深度优先搜索DFS</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/131915537" rel="nofollow">文件目录大小</a></td> 
   <td>深度优先搜索DFS</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/132524247" rel="nofollow">战场索敌</a></td> 
   <td>深度优先搜索DFS</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/131524993" rel="nofollow">查找单入口空闲区域</a></td> 
   <td>深度优先搜索DFS</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/132636653" rel="nofollow">等和子数组最小和</a></td> 
   <td>深度优先搜索DFS</td> 
   <td>B卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/134933461" rel="nofollow">区间交集</a></td> 
   <td>深度优先搜索DFS</td> 
   <td>B卷</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/132093066" rel="nofollow">跳格子游戏</a></td> 
   <td>深度优先搜索DFS</td> 
   <td>B卷</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/132185994" rel="nofollow">欢快的周末</a></td> 
   <td>深度优先搜索DFS</td> 
   <td>B卷</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/131627071" rel="nofollow">宜居星球改造计划</a></td> 
   <td>深度优先搜索DFS</td> 
   <td>B卷</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/134868135" rel="nofollow">目录删除</a></td> 
   <td>深度优先搜索DFS</td> 
   <td>B卷</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/135162290" rel="nofollow">最少面试官数</a></td> 
   <td>深度优先搜索DFS</td> 
   <td>B卷</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/135003115" rel="nofollow">连续出牌数量</a></td> 
   <td>深度优先搜索DFS</td> 
   <td>B卷</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/135001692" rel="nofollow">任务最优调度</a></td> 
   <td>深度优先搜索DFS</td> 
   <td>B卷</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/133917245" rel="nofollow">机器人走迷宫</a></td> 
   <td>深度优先搜索DFS</td> 
   <td>B卷</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/137028629" rel="nofollow">最长广播效应</a></td> 
   <td>广度优先搜索BFS</td> 
   <td>C卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/136724891" rel="nofollow">污染水域</a></td> 
   <td>广度优先搜索BFS</td> 
   <td>C卷</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/131673131" rel="nofollow">矩阵中非1的元素个数</a></td> 
   <td>广度优先搜索BFS</td> 
   <td>B卷</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/130764032" rel="nofollow">计算网络信号</a></td> 
   <td>广度优先搜索BFS</td> 
   <td>B卷</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/137025805" rel="nofollow">按图找最近的路</a></td> 
   <td>矩阵、最短路径问题</td> 
   <td>C卷</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/132326551" rel="nofollow">最小传输时延Ⅱ</a></td> 
   <td>矩阵、最短路径问题</td> 
   <td>B卷</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/guorui_java/article/details/130892786" rel="nofollow">快速开租建站</a></td> 
   <td>拓扑排序</td> 
   <td>B卷</td> 
   <td>200</td> 
  </tr> 
 </tbody> 
</table>

#### 十二、 动态规划 ####

#### 十三、数学问题 ####

[OD_JAVA_A_B_C]: https://blog.csdn.net/guorui_java/category_12293298.html