# algorithm-homework

**Repository Path**: xkond/algorithm-homework

## Basic Information

- **Project Name**: algorithm-homework
- **Description**: No description available
- **Primary Language**: Unknown
- **License**: Not specified
- **Default Branch**: main
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2021-11-21
- **Last Updated**: 2021-12-12

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

# README

## 极客时间算法训练营每周作业

### WEEK1
- 加一 https://leetcode-cn.com/problems/plus-one/
- 合并相同列表 https://leetcode-cn.com/problems/merge-two-sorted-lists/
- 设计循环双端队列 https://leetcode-cn.com/problems/design-circular-deque/
- 最大矩阵 https://leetcode-cn.com/problems/maximal-rectangle/

### WEEK2
- 子域名访问映射 https://leetcode-cn.com/problems/subdomain-visit-count/
- 数组的度 https://leetcode-cn.com/problems/degree-of-an-array/
- 元素和为目标值的子矩阵数量 https://leetcode-cn.com/problems/number-of-submatrices-that-sum-to-target/
- 和为 K 的子数组 https://leetcode-cn.com/problems/subarray-sum-equals-k/

### WEEK3
- 合并K个升序链表 https://leetcode-cn.com/problems/merge-k-sorted-lists/
- 全排列 https://leetcode-cn.com/problems/permutations-ii/
- 从中序和后序遍历序列构造二叉树 https://leetcode-cn.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/
- 课程表 https://leetcode-cn.com/problems/course-schedule-ii/
- 冗余链接 https://leetcode-cn.com/problems/redundant-connection-ii/

### WEEK4

- 被围绕的区域 https://leetcode-cn.com/problems/surrounded-regions/
- 设计推特 https://leetcode-cn.com/problems/design-twitter/
- 把二叉搜索树转换为累加树 https://leetcode-cn.com/problems/convert-bst-to-greater-tree/