2023华为od面经~ （笔试 HR资面技术面一面二面综面）

刺骨的言语ヽ痛彻心扉 2023-10-09 20:43 49阅读 0赞

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

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

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

### 华为OD统一考试A卷+B卷 新题库说明 ###

2023年5月份，华为官方已经将的 2022/0223Q(1/2/3/4)统一修改为OD统一考试（A卷）和OD统一考试（B卷）。  
你收到的链接上面会标注A卷还是B卷。请注意：根据反馈，目前大部分收到的都是B卷。但是仍有概率抽到A卷。  
**A卷对应2023的新题库（2022Q4 20223Q1）** **B卷对应20022部分考题以及新出的题目**

专栏：[2023华为OD机试(A卷+B卷)（C++JavaJSPy）][2023_OD_A_B_C_JavaJSPy]  
专栏：[2023华为OD机试(A卷)（C++ Java JS Py）][2023_OD_A_C_ Java JS Py]  
专栏：[2023华为OD机试(B卷)（C++ Java JS Py）][2023_OD_B_C_ Java JS Py]

### 面试者信息 ###

*  语言：java
 *  工作经验：半年
 *  目标部门：电商业务

### 面试流程 ###

总体流程很快，HR很负责经常帮忙催进度，从笔试到发offer差不多两周。

*  **笔试**
 *  **HR资面**
 *  **技术面**
 *  **一面**
 *  **二面**
 *  **综面**

#### 笔试 ####

*  笔试得分：395
 *  难度：不高

##### 题目详情 #####

1.  第一、第三题：dp和哈希表，100%通过。第一题题目一开始没看懂意思，看了挺久。
2.  第二题：为新员工找友好度最高的座位，数组表示座位情况，如11101211100111211，0为空，1为老员工，2为墙壁。空座位左右连续老员工数量等于该座位友好度，遇到墙壁则好友度清空。
    
     *  时间复杂度O(n)，有一个用例超时了，95%。
     *  初始思路是遍历数组，遍历到0时查找左右友好度情况，但是会有重复计算的问题，想着优化一下。
     *  改为遍历一遍数组，遍历的同时维护左友好度和右友好度以及当前是否已记录座位。初始状态未记录座位，增加左友好度，当遇到座位时判断是否已记录座位，已记录时计算一次结果（左+右），未记录时更新状态。遇到老员工时根据是否已记录座位增加左/右友好度，遇到墙时计算结果+清除友好度。

### 性格测试（综合测试） ###

按照 HR 给的注意事项选就行，注意前后选择的一致性，选择正向的答案。

### 面试经历 ###

*  HR 资面：简单聊了一会儿，HR 说西安和深圳都能去，西安比较缺人。我觉得有点远，想去深圳，HR 说面试完再确定也可以。最后也去的深圳。
 *  离职原因：期望工作地，期望薪资。
 *  最近情况：投简历、复习、面试。

#### 技术面 ####

技术面都是技术问题 + 编程题，技术问题答得一般般，面试当天是周五，上午一面晚上二面，那周前几天已经面试了 10 场没啥状态，有点开摆了，编程题都 AC。

*  编程题是分享屏幕，然后用自己电脑上的 IDE 编写，写完面试官会给用例。

##### 一面 #####

*  八股问的都不是很深，记不太清了，各个方面有提到，会的就简单聊一下，不会的就换其他问题。
 *  聊项目，业务 + 技术。
 *  Java 集合。
 *  SpringBoot 自动配置原理。
 *  MySQL 索引原理，工作中数据库优化的案例。
 *  Redis 数据类型和原理。
 *  编程题：找出有效 MAC 地址，通常表示为 12 个 16 进制数，如：00-16-EA-AE-3C-40。给一串字符串， 如 00-16:aA-FE:3C-40-11-99-AA-Z，找出其中所有的有效 MAC 地址，不区分大小写以及 : 和 -。

解法：MAC 地址有固定长度，思路是滑动窗口判断当前部分是否为有效 MAC 地址。首先先对原字符串 LowerCase()，再将 : 替换为 -，方便验证。验证的地方主要是窗口内是否为 12 个 16 进制数，并且通过 - 连接。

### 二面 ###

#### 编程题 ####

面试官先询问是否做过该题，回答没有做过原题，但有一些思路。在讲述思路后，面试官确认无问题后开始写代码。

#### 项目经验 ####

*  谈论了个人项目经验。
 *  面向对象和面向过程的理解。
 *  平时使用的JDK版本（JDK8），并讨论了JDK8和旧版本之间的不同之处，如集合优化、JVM和新特性等。
 *  讨论了lambda表达式的优缺点，如语法精简和不易调试等。
 *  泛型的用处、应用、原理以及程序在运行时如何知道是哪种类型。
 *  线程池的7个参数，分析线程池工作时各参数变化情况（初始线程池容量x，最大容量y，队列长度z，来了n个任务，讲一下会发生的情况）。

#### 技术知识 ####

*  Spring AOP的原理和应用。
 *  MySQL explain。
 *  单元测试。
 *  设计模式的应用和了解的种类。

#### 编程题 ####

给一个01矩阵，找其中1表示的最大面积正方形。

例如：

0 0 1 0
    1 1 1 0
    1 1 0 0

解法：遍历矩阵，找到为1的点后以这个点作为正方形的左上角，扩展正方形，同时计算最大面积。

### 综面 ###

面试官表示他们部门招人比较看重编程能力

问简历上的项目，更侧重对业务的提问  
日常学习方式（看书、刷题），为什么要刷题，觉得有用吗  
上一段工作中的收获

## ACM输入输出模式 ##

如果你经常使用**Leetcode**,会知道**letcode**是不需要编写输入输出函数的。但是华为OD机考使用的是 **ACM 模式**，需要手动编写输入和输出。

所以最好在牛-客上提前熟悉这种模式。例如C++使用`cin/cout`,python使用`input()/print()`。JavaScript使用node的`readline()`和`console.log()`。Java 使用`sacnner/system.out.print()`

## 机考代码查重 ##

华为OD机考完成之后，官方会进行代码查重。**华为 od 机考确实有很大的概率抽到原题**。如果碰到了题库中的原题，一定不要直接使用题解中的代码，尤其是变量名，一定要修改，可以改成毫无意义的单词。除了变量名之外，代码的组织结构和逻辑一定要进行改变，这就要求在日常的刷题中，提前编写好属于自己的代码。

## 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>阿里巴巴找黄金宝箱</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> 
 </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> 
 </tbody> 
</table>

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

*  华为OD在线刷题OJ
 *   *  华为OD统一考试A卷+B卷 新题库说明
     *  面试者信息
     *  面试流程
     *   *  笔试
         *   *  题目详情
     *  性格测试（综合测试）
     *  面试经历
     *   *  技术面
         *   *  一面
     *  二面
     *   *  编程题
         *  项目经验
         *  技术知识
         *  编程题
     *  综面
 *  ACM输入输出模式
 *  机考代码查重
 *  2023华为OD统一考试（B卷） - 100分值
 *  2023华为OD统一考试（B卷） - 200分值

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