Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/k66inthesky/leetcode-rust
Leetcode Blind75 in Rust 表格整理及詳解
https://github.com/k66inthesky/leetcode-rust
blind75 leetcode rust
Last synced: 3 days ago
JSON representation
Leetcode Blind75 in Rust 表格整理及詳解
- Host: GitHub
- URL: https://github.com/k66inthesky/leetcode-rust
- Owner: k66inthesky
- Created: 2024-02-06T22:00:34.000Z (11 months ago)
- Default Branch: main
- Last Pushed: 2024-02-21T10:44:52.000Z (11 months ago)
- Last Synced: 2024-11-09T00:57:20.221Z (about 2 months ago)
- Topics: blind75, leetcode, rust
- Language: Rust
- Homepage: https://www.youtube.com/@k66inthesky
- Size: 9.77 KB
- Stars: 2
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Leetcode-Rust
Implement Leetcode Blind75 in Rust
+ 教學影片：待補 預計放https://www.youtube.com/@k66inthesky
+ 目前進度：8/75
| Total | Easy | Medium | Hard |
| :----: | :----: | :----: | :----: |
| 8 | 3 | 5 | 0 |
### 题目
| 順序 | 題目 | 程式碼 | 分類1 | 分類2| 分類3 |難度 |
| ---- | ---- | ---- | ---- | ---- | ---- | ---- |
|1 | [1. Two Sum](https://leetcode.com/problems/two-sum/) | [src](https://github.com/k66inthesky/Leetcode-Rust/blob/main/src/1.rs) | Array | Hash Table || Easy |
|2 | [121. Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | [src](https://github.com/k66inthesky/Leetcode-Rust/blob/main/src/121.rs) | Array | DP[[註1]](#註1) | | Easy |
|3 | [217. Contains Duplicate](https://leetcode.com/problems/contains-duplicate) | [src](https://github.com/k66inthesky/Leetcode-Rust/blob/main/src/217.rs) | Array | Hash Table | Sorting | Easy |
|4 | [238. Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self) | [src](https://github.com/k66inthesky/Leetcode-Rust/blob/main/src/238.rs) | Array | Prefix Sum | | Medium |
|5 | [53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | [src](https://github.com/k66inthesky/Leetcode-Rust/src/blob/main/53.rs) | Array | D&C[[註2]](#註2) | DP | Medium |
|6 | [152. Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) | [src](https://github.com/k66inthesky/Leetcode-Rust/src/blob/main/152.rs) | Array | DP | | Medium |
|7 | [153. Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | [src](https://github.com/k66inthesky/Leetcode-Rust/src/blob/main/153.rs) | Array | BS[[註3]](#註3) | | Medium |
|8 | [33. Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) | [src](https://github.com/k66inthesky/Leetcode-Rust/src/blob/main/33.rs) | Array | BS | | Medium |
|9 | []() | [src](https://github.com/k66inthesky/Leetcode-Rust/src/blob/main/.rs) | | | | |
|10 | []() | [src](https://github.com/k66inthesky/Leetcode-Rust/src/blob/main/.rs) | | | | |
> 註1 DP=Dynamic Programming
> 註2 D&C=Devide&Conquer
> 註3 BS=Binary Search