Backups/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

auto commit

Browse Source
This commit is contained in:
CyC2018
2019-04-21 10:32:36 +08:00
parent 7753c5f0aa
commit fb73f5cbbe
78 changed files with 136 additions and 178 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
docs/notes/Leetcode 题解 - 哈希表.md
View File

@ -1,9 +1,9 @@
<!-- GFM-TOC -->
<div class="toc"><!-- GFM-TOC -->
* [1. 数组中两个数的和为给定值](#1-数组中两个数的和为给定值)
* [2. 判断数组是否含有重复元素](#2-判断数组是否含有重复元素)
* [3. 最长和谐序列](#3-最长和谐序列)
* [4. 最长连续序列](#4-最长连续序列)
<!-- GFM-TOC -->
<!-- GFM-TOC --></div>
哈希表使用 O(N) 空间复杂度存储数据，并且以 O(1) 时间复杂度求解问题。