2023 华为OD机试备考攻略以及题库目录分值说明考点说明（A卷+ B卷）

缺乏、安全感 2024-03-25 20:39 13阅读 0赞

#### 文章目录 ####

*  华为OD在线刷题OJ
 *  华为题库
 *  更新说明
 *  支持的语言
 *  题库目录
 *  2023华为OD统一考试（B卷） - 100分值
 *  2023华为OD统一考试（B卷） - 200分值
 *  华为OD统一考试【A卷】题库-100分
 *  华为OD统一考试【A卷】题库-200分
 *  华为od介绍
 *   *  招聘流程
     *  机考
     *  备考
     *  考试注意事项
     *  TIPS

## 华为OD在线刷题OJ ##

全新华为OD在线刷题平台登场！解锁上岸华为OD的终极秘籍！  
亲爱的华为OD候选人们，你们期待已久的刷题平台终于来了！全新的华为OD机试在线刷题平台已经上线，为你们提供了一个全新的学习和提升华为OD机考编程技能的机会！无论你是初学者还是有经验的程序员，相信这个平台将成为你们上岸华为OD的终极秘籍！

[【华为OD在线刷题OJ-点击立即开始刷题】)][OD_OJ-]

## 华为题库 ##

专栏：[2023华为OD机试(A卷)（C++ Java JS Py））][2023_OD_A_C_ Java JS Py][https://blog.csdn.net/banxia\_frontend/category\_12228764.html][2023_OD_A_C_ Java JS Py]

专栏：[2023华为OD机试(A卷+B卷)（C++JavaJSPy）][2023_OD_A_B_C_JavaJSPy][https://blog.csdn.net/banxia\_frontend/category\_12225173.html][2023_OD_A_B_C_JavaJSPy]

专栏：[2023华为OD机试(B卷)（C++ Java JS Py）][2023_OD_B_C_ Java JS Py][https://blog.csdn.net/banxia\_frontend/category\_12257144.html][2023_OD_B_C_ Java JS Py]

## 更新说明 ##

2023年5月份，华为官方已经将的 2022/0223Q(1/2/3/4)统一修改为 2023A卷和2023B卷。你收到的链接上面会标注A卷还是B卷。请注意B卷对应之前专栏的20022部分考题以及新出的题目。OD 统一考试（B 卷）是 2022 年旧题库+新增题

*  OD 统一考试（A 卷 2022Q4）
 *  OD 统一考试（A 卷 2023Q1）
 *  OD 统一考试（B 卷）

OD 统一考试（A 卷 2022Q4）与 OD 统一考试（A 卷 2023Q1）为之前的2023题库 统一归类到OD 统一考试（A 卷)  
OD 统一考试（B 卷）为20022部分考题以及新出的题目，统一归类到OD 统一考试（A 卷)

## 支持的语言 ##

目前大部分题 使用C++ Java JavaScript 以及python实现。

**部分题目，使用不同语言实现不同的思路。**

## 题库目录 ##

## 2023华为OD统一考试（B卷） - 100分值 ##

<table> 
 <thead> 
  <tr> 
   <th><strong>题目</strong></th> 
   <th>链接</th> 
   <th><strong>知识点</strong></th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td>敏感字段加密</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130042378" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130042378</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>IPv4地址转换成整数</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130042566" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130042566</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>报文重排序</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130814556" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130814556</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>整数编码</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130816655" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130816655</a></td> 
   <td></td> 
  </tr> 
  <tr> 
   <td>阿里巴巴找黄金宝箱 (1)</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130817028" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130817028</a></td> 
   <td>指针</td> 
  </tr> 
  <tr> 
   <td>VLAN资源池</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130042590" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130042590</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>统计监控器、需要打开多少监控器</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130875613" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130875613</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>求字符串中所有整数的最小和</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130043034" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130043034</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>求满足条件的最长子串的长度</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130043268" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130043268</a></td> 
   <td>滑动窗口</td> 
  </tr> 
  <tr> 
   <td>字符串分割</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130888094" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130888094</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>简易压缩算法</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130887642" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130887642</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>一种字符串压缩表示的解压</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130043674" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130043674</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>矩阵最大值</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130044296" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130044296</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>字符串加密</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130047719" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130047719</a></td> 
   <td>动态规划</td> 
  </tr> 
  <tr> 
   <td>英文输入法</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130047940" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130047940</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>拼接URL</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130049091" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130049091</a></td> 
   <td>正则匹配</td> 
  </tr> 
  <tr> 
   <td>相对开音节</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130057726" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130057726</a></td> 
   <td>正则匹配</td> 
  </tr> 
  <tr> 
   <td>最远足迹</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130057872" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130057872</a></td> 
   <td>数据结构</td> 
  </tr> 
  <tr> 
   <td>字符串序列判定</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130069530" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130069530</a></td> 
   <td>指针</td> 
  </tr> 
  <tr> 
   <td>数列描述</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130070682" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130070682</a></td> 
   <td>动态规划</td> 
  </tr> 
  <tr> 
   <td>寻找相同子串</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130071234" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130071234</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>字符串变换最小字符串</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129289091" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129289091</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>找终点</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130117501" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130117501</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>执行时长</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130119270" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130119270</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>用户调度问题</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130889808" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130889808</a></td> 
   <td>深度优先搜索DFS</td> 
  </tr> 
  <tr> 
   <td>数组拼接</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130173373" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130173373</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>检查是否存在满足条件的数字组合</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130174695" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130174695</a></td> 
   <td>深度优先搜索DFS</td> 
  </tr> 
  <tr> 
   <td>水仙花数 Ⅰ</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130171852" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130171852</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>路灯照明问题</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130174877" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130174877</a></td> 
   <td>区间问题 / 区间合并</td> 
  </tr> 
  <tr> 
   <td>消消乐游戏</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130177360" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130177360</a></td> 
   <td>数据结构</td> 
  </tr> 
  <tr> 
   <td>用连续自然数之和来表达整数</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130172885" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130172885</a></td> 
   <td>滑动窗口</td> 
  </tr> 
  <tr> 
   <td>最大花费金额</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130116925" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130116925</a></td> 
   <td>滑动窗口</td> 
  </tr> 
  <tr> 
   <td>分糖果</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130116367" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130116367</a></td> 
   <td>位运算</td> 
  </tr> 
  <tr> 
   <td>猴子爬山</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130115751" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130115751</a></td> 
   <td>动态规划</td> 
  </tr> 
  <tr> 
   <td>数组组成的最小数字</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130114597" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130114597</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>整型数组按个位值排序</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129306346" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129306346</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>运维日志排序</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130114406" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130114406</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>字符统计及重排</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130173033" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130173033</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>按身高和体重排队</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130104661" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130104661</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>磁盘容量排序</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130104442" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130104442</a></td> 
   <td>双指针</td> 
  </tr> 
  <tr> 
   <td>5键键盘</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130096051" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130096051</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>报数游戏</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130095889" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130095889</a></td> 
   <td>约瑟夫环问题</td> 
  </tr> 
  <tr> 
   <td>高矮个子排队</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130095797" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130095797</a></td> 
   <td>滑动窗口</td> 
  </tr> 
  <tr> 
   <td>分班问题</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130095305" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130095305</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>喊7的次数重排</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130072441" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130072441</a></td> 
   <td>约瑟夫环问题</td> 
  </tr> 
  <tr> 
   <td>玩牌高手</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130072194" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130072194</a></td> 
   <td>动态规划</td> 
  </tr> 
  <tr> 
   <td>最少交换次数</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130042175" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130042175</a></td> 
   <td>滑动窗口</td> 
  </tr> 
  <tr> 
   <td>水仙花数Ⅱ</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130036570" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130036570</a></td> 
   <td>分治递归</td> 
  </tr> 
  <tr> 
   <td>关联子串</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130036439" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130036439</a></td> 
   <td>深度优先搜索DFS</td> 
  </tr> 
  <tr> 
   <td>矩形相交的面积</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130036104" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130036104</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>数字反转打印</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130022410" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130022410</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>太阳能板最大面积</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130022091" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130022091</a></td> 
   <td>双指针</td> 
  </tr> 
  <tr> 
   <td>绘图机器</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130022003" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130022003</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>字符串子序列II</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130010116" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130010116</a></td> 
   <td>双指针</td> 
  </tr> 
  <tr> 
   <td>求最多可以派出多少支团队</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130009910" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130009910</a></td> 
   <td>双指针</td> 
  </tr> 
  <tr> 
   <td>流水线</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130000922" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130000922</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>事件推送、 所有（Ai, Bj）数对</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130000553" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130000553</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>找朋友</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129999376" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129999376</a></td> 
   <td>数据结构</td> 
  </tr> 
  <tr> 
   <td>统计射击比赛成绩</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129998971" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129998971</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>分苹果</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129998670" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129998670</a></td> 
   <td>位运算</td> 
  </tr> 
  <tr> 
   <td>最长的顺子</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129793342" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129793342</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>斗地主之顺子</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129844867" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129844867</a></td> 
   <td>数据结构</td> 
  </tr> 
  <tr> 
   <td>热点网站统计</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129895021" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129895021</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>出错的或电路</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129939817" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129939817</a></td> 
   <td>深度优先搜索DFS</td> 
  </tr> 
  <tr> 
   <td>快速人名查找</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129827444" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129827444</a></td> 
   <td>回溯算法</td> 
  </tr> 
  <tr> 
   <td>比赛</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130898490" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130898490</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>补种未成活胡杨</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130900032" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130900032</a></td> 
   <td>滑动窗口</td> 
  </tr> 
  <tr> 
   <td>五子棋迷</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130900644" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130900644</a></td> 
   <td>滑动窗口</td> 
  </tr> 
  <tr> 
   <td>组成最大数</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130901124" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130901124</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>全量和已占用字符集</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130071738" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130071738</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>乱序整数序列两数之和绝对值最小</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130901386" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130901386</a></td> 
   <td>双指针</td> 
  </tr> 
  <tr> 
   <td>寻找连续区间、数据连续和</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130901621" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130901621</a></td> 
   <td>动态规划</td> 
  </tr> 
  <tr> 
   <td>非严格递增连续数字序列</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130901696" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130901696</a></td> 
   <td>指针</td> 
  </tr> 
  <tr> 
   <td>快递运输</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130901947" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130901947</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>不等式是否满足约束并输出最大差</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130902299" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130902299</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>靠谱的车</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130902533" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130902533</a></td> 
   <td>位运算</td> 
  </tr> 
  <tr> 
   <td>选修课</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130903630" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130903630</a></td> 
   <td>位运算</td> 
  </tr> 
  <tr> 
   <td>连续字母长度</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130048972" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130048972</a></td> 
   <td>正则匹配</td> 
  </tr> 
  <tr> 
   <td>找车位</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130019456" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130019456</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>数字涂色</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130172193" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130172193</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>查找众数及中位数</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129288857" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129288857</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>数组去重和排序</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129720509" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129720509</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>单词接龙</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130044643" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130044643</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>最长公共后缀</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130910329" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/1309103293</a></td> 
   <td>排序</td> 
  </tr> 
  <tr> 
   <td>单词接龙</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130044643" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130044643</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>最大矩阵和、最大子矩阵</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130934482" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130934482</a></td> 
   <td>动态规划</td> 
  </tr> 
  <tr> 
   <td>数据分类</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129845067" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129845067</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>TLV 编码</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130048337" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130048337</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>调座、座位调整</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/131057134" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/131057134</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>字符串摘要</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/131077082" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/131077082</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>代码编辑器</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/131076674" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/131076674</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>经典屏保</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/131077496" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/131077496</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>食堂供餐</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/131077763" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/131077763</a></td> 
   <td>二分法</td> 
  </tr> 
  <tr> 
   <td>阿里巴巴找黄金宝箱(II)</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/131077928" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/131077928</a></td> 
   <td>深度优先搜索DFS</td> 
  </tr> 
  <tr> 
   <td>阿里巴巴找黄金宝箱(I)</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/131078473" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/131078473</a></td> 
   <td>指针</td> 
  </tr> 
  <tr> 
   <td>模拟消息队列</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/131097948" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/131097948</a></td> 
   <td></td> 
  </tr> 
  <tr> 
   <td>阿里巴巴找黄金宝箱(V)</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/131098330" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/131098330</a></td> 
   <td>滑动窗口</td> 
  </tr> 
  <tr> 
   <td>矩阵稀疏扫描</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/131098534" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/131098534</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>报文回路</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/131387764" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/131387764</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>计算最接近的数</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/131466725" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/131466725</a></td> 
   <td></td> 
  </tr> 
  <tr> 
   <td>求最小步数</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/131487991" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/131487991</a></td> 
   <td>逻辑分析，动态规划</td> 
  </tr> 
  <tr> 
   <td>分割数组的最大差值</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/131488179" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/131488179</a></td> 
   <td></td> 
  </tr> 
  <tr> 
   <td>增强的strstr</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/131609115" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/131609115</a></td> 
   <td>正则表达式</td> 
  </tr> 
  <tr> 
   <td>支持优先级的队列</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/131609615" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/131609615</a></td> 
   <td>数据结构</td> 
  </tr> 
 </tbody> 
</table>

## 2023华为OD统一考试（B卷） - 200分值 ##

<table> 
 <thead> 
  <tr> 
   <th><strong>题目</strong></th> 
   <th align="left">链接</th> 
   <th><strong>知识点</strong></th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td>书籍叠放</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/130903074" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130903074</a></td> 
   <td>耐心排序 + 二分查找</td> 
  </tr> 
  <tr> 
   <td>We Are A Team</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/130115654" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130115654</a></td> 
   <td>数据结构 / 并查集</td> 
  </tr> 
  <tr> 
   <td>区间交集</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129793003" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129793003</a></td> 
   <td>区间问题 / 区间合并</td> 
  </tr> 
  <tr> 
   <td>跳格子游戏</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129866599" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129866599</a></td> 
   <td>图论 / 拓扑排序</td> 
  </tr> 
  <tr> 
   <td>找单词</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/130189657" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130189657</a></td> 
   <td>深度优先搜索DFS</td> 
  </tr> 
  <tr> 
   <td>字符串比较</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129813983" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129813983</a></td> 
   <td>双指针</td> 
  </tr> 
  <tr> 
   <td>德州扑克</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129987036" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129987036</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>服务失效判断</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129867851" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129867851</a></td> 
   <td>数据结构 / 并查集</td> 
  </tr> 
  <tr> 
   <td>打印任务排序</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129720672" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129720672</a></td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>最少面试官数</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129894367" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129894367</a></td> 
   <td>贪心思维</td> 
  </tr> 
  <tr> 
   <td>欢乐的周末</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129941687" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129941687</a></td> 
   <td>数据结构 / 并查集</td> 
  </tr> 
  <tr> 
   <td>找最小数</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129951423" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129951423</a></td> 
   <td>数据结构</td> 
  </tr> 
  <tr> 
   <td>单词搜索、找到它</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129793166" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129793166</a></td> 
   <td>回溯算法</td> 
  </tr> 
  <tr> 
   <td>解密犯罪时间</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/130036240" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130036240</a></td> 
   <td>深度优先搜索DFS</td> 
  </tr> 
  <tr> 
   <td>九宫格按键输入</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129803233" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129803233</a></td> 
   <td>数据结构</td> 
  </tr> 
  <tr> 
   <td>简易内存池</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129786608" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129786608</a></td> 
   <td>区间问题 / 区间交集</td> 
  </tr> 
  <tr> 
   <td>连续出牌数量</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129786290" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129786290</a></td> 
   <td>数据结构 / 并查集</td> 
  </tr> 
  <tr> 
   <td>图像物体的边界</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129940529" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129940529</a></td> 
   <td>数据结构 / 并查集</td> 
  </tr> 
  <tr> 
   <td>可以组成网络的服务器</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129865702" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129865702</a></td> 
   <td>深度优先搜索DFS</td> 
  </tr> 
  <tr> 
   <td>宜居星球改造计划</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/130876921" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130876921</a></td> 
   <td>深度优先搜索DFS</td> 
  </tr> 
  <tr> 
   <td>猜密码</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129894608" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129894608</a></td> 
   <td>深度优先搜索DFS</td> 
  </tr> 
  <tr> 
   <td>学生方阵</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129805545" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129805545</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>考古学家</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129699036" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129699036</a></td> 
   <td>深度优先搜索DFS</td> 
  </tr> 
  <tr> 
   <td>最小传输时延</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129720107" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129720107</a></td> 
   <td>图论 / 单源最短路径（dijkstra）</td> 
  </tr> 
  <tr> 
   <td>计算疫情扩散时间</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129834614" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129834614</a></td> 
   <td>图论 / 图的多源BFS</td> 
  </tr> 
  <tr> 
   <td>仿LISP运算</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129804704" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129804704</a></td> 
   <td>数据结构</td> 
  </tr> 
  <tr> 
   <td>贪吃蛇</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129718597" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129718597</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>堆栈中的剩余数字</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/130096204" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130096204</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>第k个排列</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/130021165" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130021165</a></td> 
   <td>分治递归</td> 
  </tr> 
  <tr> 
   <td>最长的指定瑕疵度的元音子串</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/130069776" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130069776</a></td> 
   <td></td> 
  </tr> 
  <tr> 
   <td>火星文计算</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/130116171" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130116171</a></td> 
   <td>正则匹配</td> 
  </tr> 
  <tr> 
   <td>篮球比赛</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/130035571" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130035571</a></td> 
   <td>深度优先搜索DFS</td> 
  </tr> 
  <tr> 
   <td>目录删除</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129855812" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129855812</a></td> 
   <td>数据结构 / 二叉树</td> 
  </tr> 
  <tr> 
   <td>叠积木</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129393995" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129393995</a></td> 
   <td>回溯算法</td> 
  </tr> 
  <tr> 
   <td>导师请吃火锅</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129877961" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129877961</a></td> 
   <td>贪心算法</td> 
  </tr> 
  <tr> 
   <td>最长广播响应</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129698669" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129698669</a></td> 
   <td>图论 / 单源最短路径（dijkstra）</td> 
  </tr> 
  <tr> 
   <td>构成正方形的数量</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/130172005" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130172005</a></td> 
   <td>数学问题</td> 
  </tr> 
  <tr> 
   <td>解压报文、压缩报文还原</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129786100" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129786100</a></td> 
   <td>数据结构</td> 
  </tr> 
  <tr> 
   <td>最长的完全交替连续方波信号</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/130918632" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130918632</a></td> 
   <td>数据结构</td> 
  </tr> 
  <tr> 
   <td>数据最节约的备份方法</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/130918632" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130918632</a></td> 
   <td>数据结构</td> 
  </tr> 
  <tr> 
   <td>数组二叉树</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/130937852" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130937852</a></td> 
   <td>数据结构 / 二叉树</td> 
  </tr> 
  <tr> 
   <td>服务器广播、需要广播的服务器数量</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/130937106" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/130937106</a></td> 
   <td></td> 
  </tr> 
  <tr> 
   <td>演唱会、计算最多能观看几场演出</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129834593" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129834593</a></td> 
   <td>区间问题 / 最多不相交区间个数</td> 
  </tr> 
  <tr> 
   <td>寻找最大价值的矿堆</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/131058167" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/131058167</a></td> 
   <td>深度优先搜索DFS</td> 
  </tr> 
  <tr> 
   <td>代表团坐车</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/131058296" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/131058296</a></td> 
   <td>动态规划</td> 
  </tr> 
  <tr> 
   <td>通过软盘拷贝文件</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/131078192" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/131078192</a></td> 
   <td>动态规划</td> 
  </tr> 
  <tr> 
   <td>相同数字组成图形的周长</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/129508588" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/129508588</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>最佳植树距离</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/131096963" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/131096963</a></td> 
   <td>二分法</td> 
  </tr> 
  <tr> 
   <td>阿里巴巴找黄金宝箱(IV)</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/131097360" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/131097360</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>战场索敌</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/131445865" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/131445865</a></td> 
   <td>深度优先搜索</td> 
  </tr> 
  <tr> 
   <td>跳格子1</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/131446639" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/131446639</a></td> 
   <td></td> 
  </tr> 
  <tr> 
   <td>不开心的小朋友</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/131447250" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/131447250</a></td> 
   <td>逻辑分析</td> 
  </tr> 
  <tr> 
   <td>最小循环子数组</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/131465563" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/131465563</a></td> 
   <td></td> 
  </tr> 
  <tr> 
   <td>树状结构查询</td> 
   <td align="left"><a href="https://blog.csdn.net/banxia_frontend/article/details/131466063" rel="nofollow">https://blog.csdn.net/banxia_frontend/article/details/131466063</a></td> 
   <td></td> 
  </tr> 
 </tbody> 
</table>

## 华为OD统一考试【A卷】题库-100分 ##

<table> 
 <thead> 
  <tr> 
   <th><strong>序号</strong></th> 
   <th><strong>题目</strong></th> 
   <th><strong>考点 or 实现</strong></th> 
   <th align="center"><strong>通过率</strong></th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td>1</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/124484923" rel="nofollow">预订酒店</a></td> 
   <td>回溯算法 /&nbsp;组合问题/排序</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>2</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/124436456" rel="nofollow">最小调整顺序次数 </a></td> 
   <td>逻辑分析</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>3</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/124894767" rel="nofollow">整理扑克牌</a></td> 
   <td>逻辑分析</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>4</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129481264" rel="nofollow">查找重复代码</a></td> 
   <td>动态规划 / 最长公共子串</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>5</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129476605" rel="nofollow">机房布局</a></td> 
   <td>区间问题 / 区间交集</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>6</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129475978" rel="nofollow">最左侧冗余覆盖子串</a></td> 
   <td>滑动窗口 / 尺举法</td> 
   <td align="center">未知</td> 
  </tr> 
  <tr> 
   <td>7</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129475856" rel="nofollow">查找单入口空闲区域</a></td> 
   <td>回溯法/DFS</td> 
   <td align="center">未知</td> 
  </tr> 
  <tr> 
   <td>8</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129470834" rel="nofollow">任务总执行时长</a></td> 
   <td>逻辑分析</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>9</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129470841" rel="nofollow">货币单位换算</a></td> 
   <td>逻辑分析</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>10</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129470849" rel="nofollow">投篮大赛</a></td> 
   <td>逻辑分析</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>11</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129470769" rel="nofollow"> 最大利润</a></td> 
   <td>贪心算法</td> 
   <td align="center">未知</td> 
  </tr> 
  <tr> 
   <td>12</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129470791" rel="nofollow">通信误码</a></td> 
   <td>字符串，数组</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>13</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129470762" rel="nofollow"> 密室逃生游戏</a></td> 
   <td>逻辑分析</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>14</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129470751" rel="nofollow">最多获得的短信条数/云短信平台优惠活动</a></td> 
   <td>动态规划 / 完全背包</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>15</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129470726" rel="nofollow">匿名信</a></td> 
   <td>逻辑分析</td> 
   <td align="center">未知</td> 
  </tr> 
  <tr> 
   <td>16</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129470544" rel="nofollow">任务调度</a></td> 
   <td>优先队列</td> 
   <td align="center">未知</td> 
  </tr> 
  <tr> 
   <td>17</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129466424" rel="nofollow">优选核酸检测点</a></td> 
   <td>区间问题</td> 
   <td align="center">未知</td> 
  </tr> 
  <tr> 
   <td>18</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129460841" rel="nofollow">挑选字符串</a></td> 
   <td>逻辑分析/字符串处理</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>19</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129460420" rel="nofollow">开心消消乐</a></td> 
   <td>BFS/并查集</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>20</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129433384" rel="nofollow"> 最大报酬</a></td> 
   <td>动态规划 / 01背包</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>21</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129433284" rel="nofollow">最短木板长度</a></td> 
   <td>贪心思维</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>22</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129413806" rel="nofollow">完美走位</a></td> 
   <td>滑动窗口 / 尺举法</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>23</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129413758" rel="nofollow">处理器问题</a></td> 
   <td>回溯算法 / 组合问题</td> 
   <td align="center">未知</td> 
  </tr> 
  <tr> 
   <td>24</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129413578" rel="nofollow">不含101的数</a></td> 
   <td>数位DP</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>25</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129413434" rel="nofollow">租车骑绿岛</a></td> 
   <td>贪心思维/逻辑分析</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>26</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129413003" rel="nofollow">等和子数组最小和</a></td> 
   <td>动态规划/回溯算法</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>27</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129392075" rel="nofollow">模拟商场优惠打折</a></td> 
   <td>逻辑分析</td> 
   <td align="center">未知</td> 
  </tr> 
  <tr> 
   <td>28</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129381008" rel="nofollow"> 对称美学</a></td> 
   <td>逻辑分析/分治递归</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>29</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129379986" rel="nofollow">二元组个数</a></td> 
   <td>逻辑分析/数据结构</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>30</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129373019" rel="nofollow">积木最远距离 相同数字的积木游戏</a></td> 
   <td>逻辑分析/数据结构</td> 
   <td align="center">未知</td> 
  </tr> 
  <tr> 
   <td>31</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129508588" rel="nofollow"> 相同数字组成图形的周长</a></td> 
   <td>逻辑分析</td> 
   <td align="center"></td> 
  </tr> 
  <tr> 
   <td>31</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129720680" rel="nofollow"> 幻方修复</a></td> 
   <td>逻辑分析</td> 
   <td align="center"></td> 
  </tr> 
  <tr> 
   <td>31</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129372980" rel="nofollow"> 计算数组中心位置</a></td> 
   <td>大数问题</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>32</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129372726" rel="nofollow">最长的密码</a></td> 
   <td>逻辑分析/字符串查找</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>33</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129372195" rel="nofollow">端口合并</a></td> 
   <td>逻辑分析/数据结构</td> 
   <td align="center">未知</td> 
  </tr> 
  <tr> 
   <td>34</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129371766" rel="nofollow">箱子之字形摆放</a></td> 
   <td>逻辑分析</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>35</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129350425" rel="nofollow">新学校选址</a></td> 
   <td>逻辑分析/数学问题</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>36</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129350216" rel="nofollow"> 打印机队列</a></td> 
   <td>优先队列</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>37</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129350111" rel="nofollow">星际篮球争霸赛 / MVP争夺战</a></td> 
   <td>回溯算法/动态规划</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>38</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129349940" rel="nofollow">真正的密码</a></td> 
   <td>逻辑</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>39</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129349731" rel="nofollow"> 机器人 可活动的最大网格点数目</a></td> 
   <td>BFS</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>40</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129348975" rel="nofollow">日志首次上报最多积分</a></td> 
   <td>动态规划</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>41</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129348865" rel="nofollow">字符串重新排序</a></td> 
   <td>字符串，数组，排序</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>42</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129348775" rel="nofollow">总最快检测效率</a></td> 
   <td>数据结构 / 优先队列</td> 
   <td align="center">未知</td> 
  </tr> 
  <tr> 
   <td>43</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129348538" rel="nofollow"> 单向链表中间节点</a></td> 
   <td>数据结构</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>44</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129347985" rel="nofollow">异常的打卡记录</a></td> 
   <td>字符串，数组</td> 
   <td align="center">未知</td> 
  </tr> 
  <tr> 
   <td>45</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129347768" rel="nofollow"> 静态扫描 / 采用合理的缓存策略，最少需要的金币数</a></td> 
   <td>贪心算法</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>46</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129346897" rel="nofollow">快递投放问题</a></td> 
   <td>逻辑分析</td> 
   <td align="center">未知</td> 
  </tr> 
  <tr> 
   <td>47</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129346521" rel="nofollow"> 优秀学员统计</a></td> 
   <td>排序</td> 
   <td align="center">未知</td> 
  </tr> 
  <tr> 
   <td>48</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129344792" rel="nofollow">猜字谜</a></td> 
   <td>字符串，数组</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>49</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129344473" rel="nofollow">最大连续文件之和 / 区块链文件转储系统</a></td> 
   <td>滑动窗口</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>50</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129344284" rel="nofollow">发现新词的数量/识图谱新词挖掘</a></td> 
   <td>滑动窗口</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>51</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129343162" rel="nofollow">日志限流</a></td> 
   <td>二分查找</td> 
   <td align="center">未知</td> 
  </tr> 
  <tr> 
   <td>52</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129340524" rel="nofollow">递增字符串</a></td> 
   <td>动态规划</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>53</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129339973" rel="nofollow">统一限载货物数最小值</a></td> 
   <td>优先队列</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>54</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129306664" rel="nofollow">最多颜色的车辆</a></td> 
   <td>滑动窗口</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>55</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129310310" rel="nofollow"> 服务中心选址</a></td> 
   <td>二分查找</td> 
   <td align="center">未知</td> 
  </tr> 
  <tr> 
   <td>56</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129287683" rel="nofollow">最优资源分配</a></td> 
   <td>逻辑分析</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>57</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129271535" rel="nofollow">找数字、找等值元素</a></td> 
   <td>逻辑分析</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>58</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129289218" rel="nofollow">新员工座位 、统计友好度最大值</a></td> 
   <td>逻辑分析</td> 
   <td align="center">未知</td> 
  </tr> 
  <tr> 
   <td>59</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129287361" rel="nofollow">网上商城优惠活动 / 模拟商场优惠打折2</a></td> 
   <td>逻辑分析</td> 
   <td align="center">未知</td> 
  </tr> 
  <tr> 
   <td>60</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129289665" rel="nofollow">最快到达医院的方法</a></td> 
   <td>数学问题</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>61</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129298688" rel="nofollow">最长回文字符串</a></td> 
   <td>字符串，数组</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>62</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129298352" rel="nofollow">人数最多的站点/小火车最多人时所在园区站点</a></td> 
   <td>最大重叠区间个数</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>63</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129287771" rel="nofollow">天然蓄水库</a></td> 
   <td>双指针</td> 
   <td align="center">未知</td> 
  </tr> 
  <tr> 
   <td>64</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129287098" rel="nofollow">组合出合法最小数</a></td> 
   <td>逻辑分析</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>65</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129287224" rel="nofollow">linux发行版的数量</a></td> 
   <td>并查集/回溯法</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>66</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129287487" rel="nofollow">最多几个直角三角形</a></td> 
   <td>回溯算法 / 组合问题</td> 
   <td align="center">未知</td> 
  </tr> 
  <tr> 
   <td>67</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129286974" rel="nofollow">单词倒序</a></td> 
   <td>逻辑分析</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>68</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129271664" rel="nofollow">寻找相似单词</a></td> 
   <td>字符串，数组</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>69</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/124484923" rel="nofollow">预订酒店</a></td> 
   <td>二分查找/排序</td> 
   <td align="center">未知</td> 
  </tr> 
  <tr> 
   <td>70</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/128266785" rel="nofollow">简单的自动曝光、平均像素值</a></td> 
   <td>逻辑分析</td> 
   <td align="center">未知</td> 
  </tr> 
  <tr> 
   <td>71</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129479993" rel="nofollow">获取最大软件版本号</a></td> 
   <td>字符串，数组</td> 
   <td align="center">100%</td> 
  </tr> 
  <tr> 
   <td>72</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129506402" rel="nofollow">数组合并</a></td> 
   <td>数据结构</td> 
   <td align="center">未知</td> 
  </tr> 
  <tr> 
   <td>74</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129508567" rel="nofollow">银行插队</a></td> 
   <td>二维数组 数结构</td> 
   <td align="center">未知</td> 
  </tr> 
  <tr> 
   <td>75</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130694397" rel="nofollow">种树</a></td> 
   <td>二分查找</td> 
   <td align="center">未知</td> 
  </tr> 
  <tr> 
   <td>76</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130665406" rel="nofollow">响应报文时间</a></td> 
   <td></td> 
   <td align="center">未知</td> 
  </tr> 
  <tr> 
   <td>77</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130713422" rel="nofollow">机智的外卖员</a></td> 
   <td>动态规划</td> 
   <td align="center">未知</td> 
  </tr> 
 </tbody> 
</table>

## 华为OD统一考试【A卷】题库-200分 ##

<table> 
 <thead> 
  <tr> 
   <th><strong>序号</strong></th> 
   <th><strong>题目</strong></th> 
   <th><strong>考点 or 实现</strong></th> 
   <th><strong>通过率</strong></th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td>1</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/123569879" rel="nofollow">士兵过河</a></td> 
   <td>动态规划</td> 
   <td>未知</td> 
  </tr> 
  <tr> 
   <td>2</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/124620080" rel="nofollow">二进制差异数</a></td> 
   <td>位运算</td> 
   <td>100%</td> 
  </tr> 
  <tr> 
   <td>3</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/124700363" rel="nofollow">简单的解压缩算法</a></td> 
   <td>回溯算法</td> 
   <td>100%</td> 
  </tr> 
  <tr> 
   <td>4</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/124931290" rel="nofollow">计算网络信号、信号强度</a><a href="https://blog.csdn.net/banxia_frontend/article/details/124700363" rel="nofollow"></a></td> 
   <td>图的BFS</td> 
   <td>100%</td> 
  </tr> 
  <tr> 
   <td>5</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129481650" rel="nofollow"> 去除多余空格</a></td> 
   <td>逻辑分析</td> 
   <td>未知</td> 
  </tr> 
  <tr> 
   <td>6</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129480252" rel="nofollow">优雅子数组</a></td> 
   <td>动态规划 / 前缀和</td> 
   <td>未知</td> 
  </tr> 
  <tr> 
   <td>7</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129479707" rel="nofollow"> 删除重复数字后的最大数字</a></td> 
   <td>栈</td> 
   <td>100%</td> 
  </tr> 
  <tr> 
   <td>8</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129479441" rel="nofollow">数字加减游戏</a></td> 
   <td>逻辑分析</td> 
   <td>100%</td> 
  </tr> 
  <tr> 
   <td>9</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129471554" rel="nofollow">最差产品奖</a></td> 
   <td>滑动窗口</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td>10</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129470805" rel="nofollow">分奖金</a></td> 
   <td>栈/暴力</td> 
   <td>分奖金</td> 
  </tr> 
  <tr> 
   <td>11</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129469498" rel="nofollow"> 查找树中元素 查找二叉树节点</a></td> 
   <td>DFS</td> 
   <td>未知</td> 
  </tr> 
  <tr> 
   <td>12</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129459019" rel="nofollow">最优高铁城市修建方案</a></td> 
   <td>图论 / 最小生成树</td> 
   <td>未知</td> 
  </tr> 
  <tr> 
   <td>13</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129413903" rel="nofollow">计算快递主站点</a></td> 
   <td>并查集/回溯算法</td> 
   <td>100%</td> 
  </tr> 
  <tr> 
   <td>14</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129391913" rel="nofollow">无向图染色</a></td> 
   <td>回溯算法 / 组合问题/无向图</td> 
   <td>100%</td> 
  </tr> 
  <tr> 
   <td>15</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129391641" rel="nofollow">最大化控制资源成本</a></td> 
   <td>数据结构/小顶堆</td> 
   <td>100%</td> 
  </tr> 
  <tr> 
   <td>16</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129391163" rel="nofollow"> 连接器问题</a></td> 
   <td>区间问题 / 区间合并/贪心算法</td> 
   <td>未知</td> 
  </tr> 
  <tr> 
   <td>17</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129390791" rel="nofollow">最大平分数组</a></td> 
   <td>动态规划/回溯算法</td> 
   <td>未知</td> 
  </tr> 
  <tr> 
   <td>18</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129390540" rel="nofollow">区间交叠问题</a></td> 
   <td>区间问题 / 区间合并/贪心算法</td> 
   <td>100%</td> 
  </tr> 
  <tr> 
   <td>19</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129348075" rel="nofollow">垃圾短信识别</a></td> 
   <td>逻辑分析</td> 
   <td>100%</td> 
  </tr> 
  <tr> 
   <td>20</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129345556" rel="nofollow">上班之路/是否能到达公司</a></td> 
   <td>深度优先搜索DFS</td> 
   <td>100%</td> 
  </tr> 
  <tr> 
   <td>21</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129347387" rel="nofollow">最多等和不相交连续子序列</a></td> 
   <td>区间问题</td> 
   <td>未知</td> 
  </tr> 
  <tr> 
   <td>22</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129344413" rel="nofollow">查找充电设备组合/最接近最大输出功率的设备</a></td> 
   <td>动态规划 / 01背包</td> 
   <td>100%</td> 
  </tr> 
  <tr> 
   <td>23</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129344080" rel="nofollow">荒地建设电站 /区域发电量统计</a></td> 
   <td>动态规划 / 前缀和</td> 
   <td>100%</td> 
  </tr> 
  <tr> 
   <td>24</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129343945" rel="nofollow">探索地块建立</a></td> 
   <td>动态规划 / 前缀和</td> 
   <td>100%</td> 
  </tr> 
  <tr> 
   <td>25</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129341046" rel="nofollow">快速开租建站</a></td> 
   <td>图论 / 拓扑排序</td> 
   <td>100%.</td> 
  </tr> 
  <tr> 
   <td>26</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129341007" rel="nofollow"> 微服务的集成测试</a></td> 
   <td>分治递归</td> 
   <td>100%</td> 
  </tr> 
  <tr> 
   <td>27</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129340363" rel="nofollow">硬件产品销售方案</a></td> 
   <td>回溯算法 / 组合问题</td> 
   <td>100%</td> 
  </tr> 
  <tr> 
   <td>28</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129340247" rel="nofollow"> 九宫格游戏 / 三阶积幻方</a></td> 
   <td>回溯算法 / 排列问题</td> 
   <td>未知</td> 
  </tr> 
  <tr> 
   <td>29</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129339459" rel="nofollow">工单调度策略</a></td> 
   <td>优先队列</td> 
   <td>未知</td> 
  </tr> 
  <tr> 
   <td>30</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129308887" rel="nofollow">Excel单元格数值统计</a></td> 
   <td>逻辑分析</td> 
   <td>未知</td> 
  </tr> 
  <tr> 
   <td>31</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129309336" rel="nofollow"> 创建二叉树</a></td> 
   <td>二叉树</td> 
   <td>未知</td> 
  </tr> 
  <tr> 
   <td>32</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129289803" rel="nofollow">组装新的数组</a></td> 
   <td>回溯算法</td> 
   <td>未知</td> 
  </tr> 
  <tr> 
   <td>33</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129289987" rel="nofollow">农场施肥 不爱施肥的小布</a></td> 
   <td>二分查找</td> 
   <td>100%</td> 
  </tr> 
  <tr> 
   <td>34</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129288708" rel="nofollow">几何平均值最大子数组</a></td> 
   <td>二分查找</td> 
   <td>未知</td> 
  </tr> 
  <tr> 
   <td>35</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129272307" rel="nofollow">字符串解密</a></td> 
   <td>字符串，数组</td> 
   <td>100%</td> 
  </tr> 
  <tr> 
   <td>36</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129393828" rel="nofollow">羊、狼、农夫过河</a></td> 
   <td>暴力枚举</td> 
   <td>100%</td> 
  </tr> 
  <tr> 
   <td>37</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129349048" rel="nofollow">过滤组合字符串</a></td> 
   <td>回溯算法 / 组合问题</td> 
   <td>未知</td> 
  </tr> 
  <tr> 
   <td>38</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129371889" rel="nofollow">快递业务站</a></td> 
   <td>并查集/回溯法</td> 
   <td>100%</td> 
  </tr> 
  <tr> 
   <td>39</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129272138" rel="nofollow"> 开放日活动</a></td> 
   <td>二分查找</td> 
   <td>100%</td> 
  </tr> 
  <tr> 
   <td>40</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129287771" rel="nofollow">天然蓄水库</a></td> 
   <td>双指针</td> 
   <td>未知</td> 
  </tr> 
  <tr> 
   <td>41</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129298352" rel="nofollow">人数最多的站</a></td> 
   <td>动态规划 / 差分数列</td> 
   <td>100%</td> 
  </tr> 
  <tr> 
   <td>42</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129340758" rel="nofollow">信号发射和接收</a></td> 
   <td>栈</td> 
   <td>100%</td> 
  </tr> 
  <tr> 
   <td>43</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/129290244" rel="nofollow">实力差距最小总和、最佳对手</a></td> 
   <td>动态规划</td> 
   <td>100%</td> 
  </tr> 
  <tr> 
   <td>44</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/123322309" rel="nofollow">基站维护工程师</a></td> 
   <td>回溯算法 / 排列问题</td> 
   <td>100%</td> 
  </tr> 
  <tr> 
   <td>45</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130310017" rel="nofollow">猜数字</a></td> 
   <td>逻辑</td> 
   <td>未知</td> 
  </tr> 
  <tr> 
   <td>46</td> 
   <td><a href="https://blog.csdn.net/banxia_frontend/article/details/130714773" rel="nofollow">获取最多食物</a></td> 
   <td>DFS</td> 
   <td>未知</td> 
  </tr> 
 </tbody> 
</table>

## 华为od介绍 ##

OD，全称(Outsourcing Dispacth)模式，目前华为和德科联合招聘的简称。华为社招基本都是OD招聘，17级以下都是OD模式（13-17）。

### 招聘流程 ###

1.  投简历
2.  机考
    
    **笔试是三道算法题，时间是150分钟也就是两个半小时。**
    
    **分值是100、100、200**
    
    如果是目标院校的话，好像150分就过了。非目标院校350分，分数线好像会高很多。我抽到的题不难，满分通过
3.  性格测试
    
    笔试通过后会做一套性格测试题。请注意此环节也会挂人！！！
4.  技术一面
    
    一般是未来直属领导进行面试
5.  技术二面
    
    不同部门的交叉面试
6.  HR与主管面
7.  录用

### 机考 ###

机试总共三题，前两题每题100分，第三题200分。

机试可选语言：C/C++、java、python、js、golang

机考时长：2.5小时

### 备考 ###

最好不要使用JS参加机考。

不要盲目刷题，2023年的题库一定要刷完。2022年有时间可以去看。最好是看有四种语言解答的题库，一种看不懂，可以换另一种语言。

### 考试注意事项 ###

1、全程不要离开摄像头；

2、三道题的答题时间合理安排，第三题一定要去做；

3、参考的题库，请务必修改代码，可能会查重！！！

### TIPS ###

1.  机考成绩一般第二天出来
2.  机考没通过，半年后可再次参加

[OD_OJ-]: https://hydro.ac/d/hwod/p
[2023_OD_A_C_ Java JS Py]: https://blog.csdn.net/banxia_frontend/category_12228764.html
[2023_OD_A_B_C_JavaJSPy]: https://blog.csdn.net/banxia_frontend/category_12225173.html
[2023_OD_B_C_ Java JS Py]: https://blog.csdn.net/banxia_frontend/category_12257144.html