# LeetCode-JavaScript

**Repository Path**: wuchunling/LeetCode-JavaScript

## Basic Information

- **Project Name**: LeetCode-JavaScript
- **Description**: 菜鸟前端程序员的LeetCode刷题记录，内有每道题的不同解法分析。
- **Primary Language**: JavaScript
- **License**: MulanPSL-1.0
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2020-07-09
- **Last Updated**: 2020-12-19

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

# LeetCode - JavaScript

菜鸟程序员的LeetCode刷题记录，代码实现使用JavaScript

### 题目
1. [移动零](https://gitee.com/wuchunling/LeetCode-JavaScript/blob/master/%E7%A7%BB%E5%8A%A8%E9%9B%B6.md "移动零")
2. [盛水最多的容器](https://gitee.com/wuchunling/LeetCode-JavaScript/blob/master/%E7%9B%9B%E6%9C%80%E5%A4%9A%E6%B0%B4%E7%9A%84%E5%AE%B9%E5%99%A8.md "盛水最多的容器")
3. [爬楼梯](https://gitee.com/wuchunling/LeetCode-JavaScript/blob/master/%E7%88%AC%E6%A5%BC%E6%A2%AF.md "爬楼梯")
4. [三数之和](https://gitee.com/wuchunling/LeetCode-JavaScript/blob/master/%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md "三数之和")
5. [环形链表](https://gitee.com/wuchunling/LeetCode-JavaScript/blob/master/%E7%8E%AF%E5%BD%A2%E9%93%BE%E8%A1%A8.md "环形链表")
6. [有效的括号](https://gitee.com/wuchunling/LeetCode-JavaScript/blob/master/%E6%9C%89%E6%95%88%E7%9A%84%E6%8B%AC%E5%8F%B7.md "有效的括号")
7. [最小栈](https://gitee.com/wuchunling/LeetCode-JavaScript/blob/master/%E6%9C%80%E5%B0%8F%E6%A0%88.md "最小栈")


### 常见的时间复杂度
1. 常数复杂度 O(1)<br>
`console.log('1')`
2. 对数复杂度 O(logn)<br>
```
for(let i=0;i<n;i=i*2) {
  console.log('1')
}
```
3. 线性复杂度 O(n)<br>
```
for(let i=0;i<n;i++) {
  console.log('1')
}
```
4. 平方复杂度 O(n<sup>2</sup>)<br>
```
for(let i=0;i<n;i++) {
  for(let j=0;j<n;j++) {
    console.log('1')
  }
}
```
5. 立方复杂度 O(n<sup>3</sup>)<br>
```
for(let i=0;i<n;i++) {
  for(let j=0;j<n;j++) {
    for(let k=0;k<n;k++) {
      console.log('1')
    }
  }
}
```
6. 指数复杂度 O(2<sup>n</sup>)<br>
```
var fibonacci = function(n) {
  if(n <= 2 ) return n
  return fibonacci(n-1) + fibonacci(n-2)
}
```
7. 阶乘复杂度 O(n!)<br>

### 常见复杂度示例
O(1):<br>
O(logn): 二分查找法<br>
O(n): 二叉树遍历、二维有序矩阵查找、DFS广度优先搜索、BFS深度优先搜索查找算法、图的遍历<br>
O(nlogn): 归并排序<br>


### 常见时间复杂度的曲线图
![](https://ss2.bdstatic.com/70cFvnSh_Q1YnxGkpoWK1HF6hhy/it/u=479358964,3323145130&fm=26&gp=0.jpg)
![](https://ss1.bdstatic.com/70cFvXSh_Q1YnxGkpoWK1HF6hhy/it/u=988484808,831486433&fm=26&gp=0.jpg)
![](https://ss0.bdstatic.com/70cFuHSh_Q1YnxGkpoWK1HF6hhy/it/u=49455351,3220021657&fm=26&gp=0.jpg)
![](https://timgsa.baidu.com/timg?image&quality=80&size=b9999_10000&sec=1594375745680&di=260b3a5912b412f30888c036376af789&imgtype=0&src=http%3A%2F%2Fimg1.mukewang.com%2F5bdd8a1a0001316104640275.jpg)