# LeetCode_Weekly_Contest

**Repository Path**: davidditao/LeetCode_Weekly_Contest

## Basic Information

- **Project Name**: LeetCode_Weekly_Contest
- **Description**: LeetCode周赛记录
- **Primary Language**: Unknown
- **License**: Not specified
- **Default Branch**: main
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2022-05-15
- **Last Updated**: 2022-06-05

## Categories & Tags

**Categories**: Uncategorized

**Tags**: LeetCode

## README

| 场次                                                         | 排名        | 得分 | 完成时间 | 题目1                                                        | 题目2                                                        | 题目3                                                        | 题目4                                                        |
| ------------------------------------------------------------ | ----------- | ---- | -------- | ------------------------------------------------------------ | ------------------------------------------------------------ | ------------------------------------------------------------ | ------------------------------------------------------------ |
| [第 78 场双周赛](https://leetcode.cn/contest/biweekly-contest-78/) | 2877 / 4347 | 7    | 1:22:41  | [题目1 (3)](https://leetcode.cn/problems/find-the-k-beauty-of-a-number/) 0:21:39 | [题目2 (4)](https://leetcode.cn/problems/number-of-ways-to-split-array/) 1:02:41 :bug: 4 | [题目3 (5)](https://leetcode.cn/problems/maximum-white-tiles-covered-by-a-carpet/) | [题目4 (6)](https://leetcode.cn/problems/substring-with-largest-variance/) |
| [第 293 场周赛](https://leetcode.cn/contest/weekly-contest-293/) | 4825 / 7356 | 7    | 1:37:40  | [题目1 (3)](https://leetcode.cn/problems/find-resultant-array-after-removing-anagrams/) 0:35:18 :bug:3 | [题目2 (4)](https://leetcode.cn/problems/maximum-consecutive-floors-without-special-floors/) 1:07:40 :bug: 3 | [题目3 (5)](https://leetcode.cn/problems/largest-combination-with-bitwise-and-greater-than-zero/) | [题目4 (7)](https://leetcode.cn/problems/count-integers-in-intervals/) |
| [第 294 场周赛](https://leetcode.cn/contest/weekly-contest-294) | 2153 / 6640 | 12   | 1:15:42  | [题目1 (3)](https://leetcode.cn/problems/percentage-of-letter-in-string/) 0:06:58 | [题目2 (4)](https://leetcode.cn/problems/maximum-bags-with-full-capacity-of-rocks/) 0:22:23 | [题目3 (5)](https://leetcode.cn/problems/minimum-lines-to-represent-a-line-chart/) 0:55:42 4:bug: 4 | [题目4 (6)](https://leetcode.cn/problems/sum-of-total-strength-of-wizards/) |
| [第 79 场双周赛](https://leetcode.cn/contest/biweekly-contest-79/) | 1945 / 4250 | 12   | 1:03:06  | [题目1 (3)](https://leetcode.cn/problems/check-if-number-has-equal-digit-count-and-digit-value/) 0:13:20 | [题目2 (4)](https://leetcode.cn/problems/sender-with-largest-word-count/) 0:26:36 | [题目3 (5)](https://leetcode.cn/problems/maximum-total-importance-of-roads/) 1:03:06 | [题目4 (6)](https://leetcode.cn/problems/booking-concert-tickets-in-groups/) |
| [第 295 场周赛](https://leetcode.cn/contest/weekly-contest-295/) | 2783 / 6447 | 7    | 1:09:25  | [题目1 (3)](https://leetcode.cn/problems/rearrange-characters-to-make-target-string/) 0:14:14 :bug:1 | [题目2 (4)](https://leetcode.cn/problems/apply-discount-to-prices/) 0:54:25 :bug:2 | [题目3 (5)](https://leetcode.cn/problems/steps-to-make-array-non-decreasing/) | [题目4 (6)](https://leetcode.cn/problems/minimum-obstacle-removal-to-reach-corner/) |
| [第 296 场周赛 ](https://leetcode.cn/contest/weekly-contest-296) | 1941 / 5721 | 12   | 0:29:19  | [题目1 (3)](https://leetcode.cn/problems/min-max-game/) 0:07:35 | [题目2 (4)](https://leetcode.cn/problems/partition-array-such-that-maximum-difference-is-k/) 0:13:48 | [题目3 (5)](https://leetcode.cn/problems/replace-elements-in-an-array/) 0:29:19 | [题目4 (6)](https://leetcode.cn/problems/design-a-text-editor/) |
|                                                              |             |      |          |                                                              |                                                              |                                                              |                                                              |
|                                                              |             |      |          |                                                              |                                                              |                                                              |                                                              |
|                                                              |             |      |          |                                                              |                                                              |                                                              |                                                              |