# leetcode-coop

**Repository Path**: jesson-deng/leetcode-coop

## Basic Information

- **Project Name**: leetcode-coop
- **Description**: leetcode AC 代码。
- **Primary Language**: C++
- **License**: MIT
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2020-08-15
- **Last Updated**: 2024-10-28

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

# Leetcode coop repository
The primary goal here is save Leetcode solution of many language.


## 一些经典题目  
1. 两个字符串的最长公共子序列--1143,583 
2. 最长递增子序列-300


## 动态规划题
1. 最长递增子序列-300  


# Uploaded items

## 000-100
+ **001.Two-Sum**</br>
  Solution.cpp</br>
  Solution.py</br>

+ **002.Add-Two-Numbers**</br>
  Solution.cpp   
  Solution.py   

+ **003.Longest-Substring-Without-Repeating-Characters**</br>
  Solution.c  

+ **004.Median-of-Two-Sorted-Arrays**</br>
  tango.cpp  

+ **005.Longest Palindromic Substring**</br>
  tango.cpp  

+ **006.ZigZag Conversion]**</br>
  tango.cpp  

+ **7.Reverse Integer**</br>
  tango.cpp  
  
+ **8.String to Integer (atoi)**</br>
  tango.cpp  
  
+ **015.3-Sum**</br>
  tango.c  

## 101-200
+ **102.Binary-Tree-Level-Order-Traversal**</br>
	Solution.cpp   
+ **104.Maximum-Depth-of-Binary-Tree**</br>
	Solution.cpp 
+ **112.Path-Sum**</br>
	tango.cpp  

## 201-300
+  **238.Product-of-Array-Except-Self**</br>
	tango.cpp  
+  **275.H-Index-II**</br>
	tango.cpp  

## 301-400
+ **303.Range-Sum-Query-Immutable**</br>
	Solution.cpp
+ **304.Range-Sum-Query-2D-Immutable**</br>
	Solution.cpp  

## 401-500 
+ **401.Binary-Watch**</br>
	Solution.cpp
+ **442.Find-All-Duplicates-in-an-Array**</br>
	Solution.cpp  
+ **445.Add-Two-Numbers-II**</br>
	Solution.cpp  

## 501-600  
+  **501.Find-Mode-in-Binary-Search-Tree**</br>
	Solution.cpp   
+  **507.Base-7**</br>
	Solution.cpp  
+  **557.Reverse-Words-in-a-String-III**</br>
	tango.cpp  

## 601-700
+  **637.Average-of-Levels-in-Binary-Tree**</br>
	Solution.cpp  
+ **643.Maximum-Average-Subarray-I**</br>
	Solution.cpp  
+ **657.Robot-Return-to-Origin**</br>
	Solution.cpp  
## 701-800
+  **706.Design-HashMap**</br>
	Solution.cpp  
+  **707.Design-Linked-List**</br>
	Solution.cpp  
+  **709.To-Lower-Case**</br>
	Solution.cpp  

## 801-900
+  **804.Unique-Morse-Code-Words**</br>
	Solution..cpp  

## 901-1000
+  **929.Unique-Email-Addresses**</br>
	Solution.cpp  
+  **966.Vowel-Spellchecker**</br>
	tango.cpp  
+  **977.Squares-of-a-Sorted-Array**</br>
	tango.cpp  
## 1001-1100
+  **1005. Maximize Sum Of Array After K Negations**</br>
   tango.cpp  
+  **1006. Clumsy Factorial**</br>   
   tango.cpp  
+  **1007.Minimum Domino Rotations For Equal Row**</br>
   tango.cpp  
+  **1008.Construct Binary Search Tree from Preorder Traversal**</br>
   tango.cpp  
+  **1012.Complement of Base 10 Integer**</br>
   tango.cpp     		
+  **1013Pairs of Songs With Total Durations Divisible by 60**</br>
   tango.cpp  
+  **1014.Capacity To Ship Packages Within D Days**</br>
   tango.cpp  
+  **1020.Partition-Array-Into-Three-Parts-With-Equal-Sum/tango.cpp**</br>
   tango.cpp  
+  **1021.Best-Sightseeing-Pair/tango.cpp**</br>
   tango.cpp  
+  **1022.Smallest-Integer-Divisible-by-K/tango.cpp**</br>
   tango.cpp  
+  **1023.Binary-String-With-Substrings-Representing-1-To-N/tango.cpp**</br>
   tango.cpp  

# 1.协作说明  
	1.先fork代码，commit到本地仓库，再提交pull request。  
	2.该题未被提交过，则新建一个目录，目录名参照其他目录名，文件名用自己的昵称，文件后缀根据对应的代码定,sample:  
	tango.cpp   jesse.cpp  author.c   
	3.如果你第一次提交，在“感谢”列表加上你的昵称。


# 2. 感谢  
感谢以下作者贡献的代码:  
----
+ tango
+ pyclear

# 3. 联系我
	Email: jxdeng3264@163.com
	
# QQ Group
![image](https://github.com/jxdeng3264/resources/blob/master/images/qqleetcode.jpeg)