interview-algorithm-python
所属分类：Leetcode/题库
开发工具：Python
文件大小：9KB
下载次数：0
上传日期：2021-08-04 16:38:05
上 传 者：
sh-1993
说明： 从一个算法工程师的角度,总结实习 校招 社招中遇到的考察编程能力的题目,不限于《剑指offer》、Leetcode等等。
(From the perspective of an algorithm engineer, summarize the problems encountered in the recruitment of internship schools to evaluate the programming ability, not limited to "Sword Finger Offer", Leetcode, etc.)
文件列表:
data_structure (0, 2021-08-05)
data_structure\sort (0, 2021-08-05)
data_structure\sort\quick_sort.py (858, 2021-08-05)
jianzhi_offer (0, 2021-08-05)
jianzhi_offer\Add.py (1265, 2021-08-05)
jianzhi_offer\FindKthToTail.py (1131, 2021-08-05)
jianzhi_offer\FindNumsAppearOnce.py (758, 2021-08-05)
jianzhi_offer\Mirror.py (1370, 2021-08-05)
jianzhi_offer\StrToInt.py (805, 2021-08-05)
jianzhi_offer\duplicate.py (581, 2021-08-05)
jianzhi_offer\jumpFloor.py (744, 2021-08-05)
jianzhi_offer\match.py (780, 2021-08-05)
jianzhi_offer\multiply.py (493, 2021-08-05)
jianzhi_offer\reOrderArray.py (1261, 2021-08-05)
jianzhi_offer\replaceSpace.py (419, 2021-08-05)
jianzhi_offer\test.py (723, 2021-08-05)
# interview-algorithm-python
从一个算法工程师的角度,总结实习/校招/社招中遇到的考察编程能力的题目,不限于《剑指offer》、Leetcode等等。
## 《数据结构》
- [快速排序](https://github.com/data_structure/sort/quick_sort.py)
## 《剑指offer》
- [替换空格](https://github.com/jianzhi_offer/replaceSpace.py)
- [跳台阶](https://github.com/jianzhi_offer/jumpFloor.py)
- [调整数组顺序使奇数位于偶数前面](https://github.com/jianzhi_offer/reOrderArray.py)
- [链表中倒数最后k个结点](https://github.com/jianzhi_offer/FindKthToTail.py)
- [二叉树的镜像](https://github.com/jianzhi_offer/Mirror.py)
- [数组中只出现一次的两个数字](https://github.com/jianzhi_offer/FindNumsAppearOnce.py)
- [不用加减乘除做加法](https://github.com/jianzhi_offer/Add.py)
- [把字符串转换成整数](https://github.com/jianzhi_offer/StrToInt.py)
- [数组中重复的数字](https://github.com/jianzhi_offer/duplicate.py)
- [构建乘积数组](https://github.com/jianzhi_offer/multiply.py)
- [正则表达式匹配](https://github.com/jianzhi_offer/match.py)
近期下载者：
相关文件：
收藏者：