2023华为OD机试题库【A卷+B卷+C卷+D卷】（JAVA、Python、C++、JS）

痛定思痛。 2024-03-22 19:21 71阅读 0赞

### 常见问题 ###

1、2023年11月之后，华为od考卷统一替换为【C+D卷】。新的题目由一部分以前考过的旧题库的题目+一部分全新题目（也就是今年才出的题目）题目组成。

2、如果时间紧迫，没有太多时间复习，建议直接从【C+D卷】开始刷。因为以前的旧题库不会再考到了，不会遇到原题。但是【C+D卷】大部分是原题。

3、如果机试挂了，**6个月**之后可以再考。

4、订阅专栏后，后面更新的答案都可以查看。以后更新的题目也会放到这个专栏里。

5、如果对题解有问题，私信我解答。

### 样例展示 ###

题目：[优雅子数组][Link 1]

链接：https://blog.csdn.net/AlgorithmHero/article/details/130743114

考点类型：双指针

### 样题展示 ###

题目：[最大利润][Link 2]

链接：https://blog.csdn.net/AlgorithmHero/article/details/130742751

考点类型：双指针

### 新题库A+B+C+D卷【目录】 ###

<table> 
 <thead> 
  <tr> 
   <th>题目</th> 
   <th>考点</th> 
   <th>分值</th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132672502" rel="nofollow">不相交子序列</a></td> 
   <td>逻辑推理</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132656978" rel="nofollow">计算主站点</a></td> 
   <td>并查集</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132571847" rel="nofollow">最长公共后缀</a></td> 
   <td>双指针</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132528570" rel="nofollow">无向染色图</a></td> 
   <td>逻辑推理</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132607703" rel="nofollow">最高价值的矿</a></td> 
   <td>深度优先搜索</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132592394" rel="nofollow">单词加密</a></td> 
   <td>正则匹配</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132482353" rel="nofollow"> 矩阵元素的边界值</a></td> 
   <td>矩阵的遍历</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132504198" rel="nofollow"> 跳房子</a></td> 
   <td>双指针</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132216470" rel="nofollow">区间交叠</a></td> 
   <td>贪心算法</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132504267" rel="nofollow">人数最多的站点</a></td> 
   <td>逻辑推理</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132482247" rel="nofollow">几何平均值最大子数组</a></td> 
   <td>二分查找</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132384799" rel="nofollow">ipv4地址转换</a></td> 
   <td>字符串处理</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132255704" rel="nofollow">田忌赛马</a></td> 
   <td>双指针</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132263422" rel="nofollow">节省内存的备份方法</a></td> 
   <td>二分查找</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132329542" rel="nofollow">查找人名</a></td> 
   <td>字符串处理</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132308158" rel="nofollow">玩牌获取的最高分</a></td> 
   <td>动态规划</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132175279" rel="nofollow">最长元音串</a></td> 
   <td>字符串遍历</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132240567" rel="nofollow">最短步数</a></td> 
   <td>数学推理</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132216767" rel="nofollow">数组中点</a></td> 
   <td>字符串遍历</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132152630" rel="nofollow">最旺的店铺</a></td> 
   <td>优先队列</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132264321" rel="nofollow">软盘拷贝文件</a></td> 
   <td>动态规划</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132123844" rel="nofollow">矩阵的最大值和最小值</a></td> 
   <td>数组的遍历</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132138575" rel="nofollow">字符串匹配</a></td> 
   <td>字符串处理</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132123724" rel="nofollow">关联子串</a></td> 
   <td>字符串处理</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132123790" rel="nofollow">金字塔形收入</a></td> 
   <td>哈希表</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132123905" rel="nofollow">最接近中位数</a></td> 
   <td>排序</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132122340" rel="nofollow">新荒岛求生</a></td> 
   <td>遍历</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132006379" rel="nofollow">查字典</a></td> 
   <td>字符串处理</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/131936337" rel="nofollow">生日蛋糕</a></td> 
   <td>二分法</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/132070066" rel="nofollow">比赛冠军</a></td> 
   <td>自定义排序</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/131680250" rel="nofollow">喊7游戏</a></td> 
   <td>贪心算法</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/131620840" rel="nofollow">火星改造</a></td> 
   <td>广度优先搜索</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/131680583" rel="nofollow">植树距离</a></td> 
   <td>逻辑推理</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://mp.csdn.net/mp_blog/creation/success/131604250" rel="nofollow">字符匹配</a></td> 
   <td>逻辑推理</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/131613517" rel="nofollow">符合要求的团队</a></td> 
   <td>逻辑推理</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/131587428" rel="nofollow">师徒关系</a></td> 
   <td>动态规划</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/131613665" rel="nofollow">增强字符串</a></td> 
   <td>滑动窗口</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130459407" rel="nofollow">施肥问题</a></td> 
   <td>逻辑推理</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130459496" rel="nofollow">组装数组</a></td> 
   <td>深度优先搜索</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/131587474" rel="nofollow">计算误码率</a></td> 
   <td>字符串遍历</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/131764007" rel="nofollow">监视器的数量</a></td> 
   <td>深度优先搜索</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130459535" rel="nofollow">开租建站</a></td> 
   <td>拓补排序</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130459867" rel="nofollow">区域发电量统计</a></td> 
   <td>前缀和</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130459893" rel="nofollow">新词挖掘</a></td> 
   <td>滑动窗口</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130459917" rel="nofollow">区块链转储系统</a></td> 
   <td>滑动窗口</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130459893" rel="nofollow">新词挖掘</a></td> 
   <td>滑动窗口</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130459951" rel="nofollow">最大控制资源成本</a></td> 
   <td>优先队列</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130459999" rel="nofollow">租车骑绿岛</a></td> 
   <td>逻辑推理</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130467171" rel="nofollow">上班之路</a></td> 
   <td>深度优先搜索</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130467237" rel="nofollow">无向图染色</a></td> 
   <td>暴力搜索</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130467294" rel="nofollow">等和子数组的最小和</a></td> 
   <td>动态规划</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130467433" rel="nofollow">单向链表的中间节点</a></td> 
   <td>逻辑推理</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130467462" rel="nofollow">不含101的数</a></td> 
   <td>逻辑推理</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130467492" rel="nofollow">简单的压缩算法</a></td> 
   <td>栈</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130467519" rel="nofollow">最小调整顺序次数</a></td> 
   <td>双端队列</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130467548" rel="nofollow">最多颜色的车辆</a></td> 
   <td>滑动窗口</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130467568" rel="nofollow">真正的密码</a></td> 
   <td>集合</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130467596" rel="nofollow">羊狼农夫过河</a></td> 
   <td>深度优先搜索</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130477273" rel="nofollow">过滤组合字符串</a></td> 
   <td>深度优先搜索</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130477300" rel="nofollow">模拟商场优惠打折</a></td> 
   <td>逻辑推理</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130477339" rel="nofollow">探索地块建立</a></td> 
   <td>前缀和</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130477377" rel="nofollow">日志首次上报最多积分</a></td> 
   <td>动态规划</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130477462" rel="nofollow">处理器问题</a></td> 
   <td>深度优先搜索</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130477515" rel="nofollow">打印机队列</a></td> 
   <td>排序</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130477548" rel="nofollow">积木最远距离</a></td> 
   <td>动态规划</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130477581" rel="nofollow">最大平分数组</a></td> 
   <td>动态规划</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130477616" rel="nofollow">修建高铁最低成本</a></td> 
   <td>并查集</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130477641" rel="nofollow">垃圾短信识别</a></td> 
   <td>逻辑推理</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130489513" rel="nofollow">机房布局</a></td> 
   <td>模拟</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/131613868" rel="nofollow">矩阵里的非1元素</a></td> 
   <td>逻辑推理</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130489589" rel="nofollow">机房布局</a></td> 
   <td>栈</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130489688" rel="nofollow">缓存需要最少金币数</a></td> 
   <td>贪心算法</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130489747" rel="nofollow">快递投放</a></td> 
   <td>哈希表</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130489804" rel="nofollow">二元组个数</a></td> 
   <td>哈希表</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130489869" rel="nofollow">连接器</a></td> 
   <td>贪心算法</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130489948" rel="nofollow">最长密码</a></td> 
   <td>哈希集合</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130489998" rel="nofollow">最大利润</a></td> 
   <td>贪心算法</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130490048" rel="nofollow">端口合并</a></td> 
   <td>贪心算法</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130490098" rel="nofollow">最左侧冗余覆盖子串</a></td> 
   <td>滑动窗口</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130511230" rel="nofollow">星际篮球争霸赛</a></td> 
   <td>动态规划</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130511283" rel="nofollow">最多获得的短信条数</a></td> 
   <td>动态规划</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130511338" rel="nofollow">最短木板长度</a></td> 
   <td>贪心算法</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130511382" rel="nofollow">挑选字符串</a></td> 
   <td>贪心算法</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130511426" rel="nofollow">数组合并</a></td> 
   <td>贪心算法</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130511485" rel="nofollow">对称美学</a></td> 
   <td>递归</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130511525" rel="nofollow">单词倒序</a></td> 
   <td>快速排序</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130511575" rel="nofollow">预定酒店</a></td> 
   <td>自定义排序</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130511616" rel="nofollow">查找单入口空闲区域</a></td> 
   <td>回溯法</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130511649" rel="nofollow">货币单位换算</a></td> 
   <td>贪心算法</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130535698" rel="nofollow">最多等和不相交连续子序列</a></td> 
   <td>动态规划</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130535734" rel="nofollow">去除多余空格</a></td> 
   <td>逻辑推理</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130535757" rel="nofollow">最差产品奖</a></td> 
   <td>滑动窗口</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130535806" rel="nofollow">计算快递业务主站点</a></td> 
   <td>深度优先搜索</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130535862" rel="nofollow">分奖金</a></td> 
   <td>单调栈</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130535889" rel="nofollow">整理扑克牌</a></td> 
   <td>逻辑分析</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130535913" rel="nofollow">猜字谜</a></td> 
   <td>自定义排序</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130536247" rel="nofollow">数字加减游戏</a></td> 
   <td>逻辑分析</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130536275" rel="nofollow">最多获得的短信条数</a></td> 
   <td>动态规划</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130541376" rel="nofollow">优雅子数组</a></td> 
   <td>双指针</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130541401" rel="nofollow">找出重复代码</a></td> 
   <td>动态规划</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130541436" rel="nofollow">密室逃生游戏</a></td> 
   <td>逻辑分析</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130541463" rel="nofollow">匿名信</a></td> 
   <td>自定义排序</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130541502" rel="nofollow">分界线</a></td> 
   <td>逻辑分析</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130541526" rel="nofollow">任务调度</a></td> 
   <td>大顶堆</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130567516" rel="nofollow">寻找路径</a></td> 
   <td>二叉树遍历</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130567547" rel="nofollow">新学校选址</a></td> 
   <td>数学问题</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130567677" rel="nofollow">机器人</a></td> 
   <td>深度优先搜索</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130567713" rel="nofollow">最大报酬</a></td> 
   <td>动态规划</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130567743" rel="nofollow">通信误码</a></td> 
   <td>逻辑分析</td> 
   <td>2023.Q1</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130567778" rel="nofollow">开心消消乐</a></td> 
   <td>广度优先搜索</td> 
   <td>2023.Q1</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130567875" rel="nofollow">投篮大赛</a></td> 
   <td>逻辑分析</td> 
   <td>2023.Q1</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130567901" rel="nofollow">开放日活动</a></td> 
   <td>二分法</td> 
   <td>2023.Q1</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130567920" rel="nofollow">相同数字的积木游戏</a></td> 
   <td>逻辑分析</td> 
   <td>2023.Q1</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130585305" rel="nofollow">二进制差异数</a></td> 
   <td>逻辑分析</td> 
   <td>2023.Q1</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130585339" rel="nofollow">获取最大软件版本号</a></td> 
   <td>字符串分割</td> 
   <td>2023.Q1</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130585376" rel="nofollow">自动曝光</a></td> 
   <td>逻辑分析</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130585401" rel="nofollow">基站维护最短距离</a></td> 
   <td>动态规划</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130585457" rel="nofollow">硬件产品销售方案</a></td> 
   <td>深度优先搜索</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130585492" rel="nofollow">计算网络信号</a></td> 
   <td>广度优先搜索</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130585595" rel="nofollow">核酸最快检测效率</a></td> 
   <td>动态规划</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130585624" rel="nofollow">异常的打卡记录</a></td> 
   <td>字符串操作</td> 
   <td>100</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130585650" rel="nofollow">最大数字</a></td> 
   <td>单调栈</td> 
   <td>200</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/AlgorithmHero/article/details/130601319" rel="nofollow">字符串解密</a></td> 
   <td>逻辑分析</td> 
   <td>100</td> 
  </tr> 
 </tbody> 
</table>

### 什么是华为OD机试 ###

华为OD机试是华为的笔试（因为是在电脑上做题，所以称为机试）。主要用于评估求职者是否适合所申请的职位。  
华为OD机试通常涵盖了多个测试领域，如算法构造、编程技巧以及错误修复等，其目标是全面评估求职者的**基础知识**、**实践技能**和**编程逻辑**等能力。这是华为招聘过程中**至关重要**的一步。

### 华为OD的笔试+面试流程 ###

华为OD面试流程主要包括以下环节：

在线笔试：测试候选人的**基础知识**、**算法构造**和**编程技巧**等。试题类型多样，包括但不限于算法问题、编程问题和数据结构问题。

性格评估：性格评估主要是用来了解求职者的**个性特点**，以更准确地评估他们的适应性、交际能力以及团队协作能力等。

技术面试：此轮面试通常由项目组的**技术负责人**进行，主要测试求职者对**技术的理解**和**实践能力**。面试内容可能包括代码问题和项目问题解答。

小组面试：华为的特色环节，一般会安排多名求职者进行群体面试，以更全面地评估他们的团队协作、沟通技巧以及领导才能等。

最终面试：这是面试的最后一轮，通常由公司的高级领导或人力资源部门的负责人进行。其主要目标是评估求职者的全面素质和潜在的**领导能力**。

**在线笔试**和**性格评估**是常规流程，所有岗位的必经历程。而其他环节不一定所有岗位都有。最后的面试结果会基于个人表现和竞争状况进行决定，而不会设定一个固定的通过人数。

### 机试通过率高吗 ###

根据华为公开的信息，华为OD机试的通关比例大约在75%左右。华为OD员工包含五个等级，分别是D1至D5，对应着13至17的级别，每个等级的题目数和难度都**各不相同**。据历年的招聘情况统计，大约只有**四分之一**的候选者能成功通过初次的在线测试。而第二轮的性格测试相比较机试就简单多了，只要你尽量表现得像个正常人，基本都能过。不过，最后的通过比例取决于候选者的实际表现及竞争状态，不会设定固定的通过人数。

总体来看，虽然华为OD在线测试的通过率并未达到100%，但仍然保持在一个较高的水平。对于候选者来说，全面提升自身的各项能力是更好地通过在线测试的关键。

### 薪资待遇 ###

<table> 
 <thead> 
  <tr> 
   <th>级别</th> 
   <th>年薪</th> 
   <th>年终</th> 
   <th>股权</th> 
   <th>所需工作经验</th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td>13</td> 
   <td>18万</td> 
   <td>2.5万</td> 
   <td>0.3万</td> 
   <td>1年</td> 
  </tr> 
  <tr> 
   <td>14</td> 
   <td>24万</td> 
   <td>5.4万</td> 
   <td>2.0万</td> 
   <td>2年</td> 
  </tr> 
  <tr> 
   <td>15</td> 
   <td>32万</td> 
   <td>12万</td> 
   <td>6.8万</td> 
   <td>3年</td> 
  </tr> 
  <tr> 
   <td>16</td> 
   <td>40万</td> 
   <td>14万</td> 
   <td>8.8万</td> 
   <td>4.5年</td> 
  </tr> 
  <tr> 
   <td>17</td> 
   <td>52万</td> 
   <td>19万</td> 
   <td>10万</td> 
   <td>5.5年</td> 
  </tr> 
  <tr> 
   <td>18</td> 
   <td>60万</td> 
   <td>40万</td> 
   <td>20万</td> 
   <td>8年</td> 
  </tr> 
 </tbody> 
</table>

[Link 1]: https://blog.csdn.net/AlgorithmHero/article/details/130743114
[Link 2]: https://blog.csdn.net/AlgorithmHero/article/details/130742751