You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+13-4
Original file line number
Diff line number
Diff line change
@@ -54,9 +54,18 @@ LeetCode Problems' Solutions
54
54
55
55
| # | Title | Solution | Difficulty |
56
56
| :-: | - | - | :-: |
57
+
| <spanid="1187">1187</span> |[Make Array Strictly Increasing](https://leetcode.com/problems/make-array-strictly-increasing"使数组严格递增")|[Go](https://github.com/openset/leetcode/tree/master/problems/make-array-strictly-increasing)| Hard |
58
+
| <spanid="1186">1186</span> |[Maximum Subarray Sum with One Deletion](https://leetcode.com/problems/maximum-subarray-sum-with-one-deletion"删除一次得到子数组最大和")|[Go](https://github.com/openset/leetcode/tree/master/problems/maximum-subarray-sum-with-one-deletion)| Medium |
59
+
| <spanid="1185">1185</span> |[Day of the Week](https://leetcode.com/problems/day-of-the-week"一周中的第几天")|[Go](https://github.com/openset/leetcode/tree/master/problems/day-of-the-week)| Easy |
60
+
| <spanid="1184">1184</span> |[Distance Between Bus Stops](https://leetcode.com/problems/distance-between-bus-stops"公交站间的距离")|[Go](https://github.com/openset/leetcode/tree/master/problems/distance-between-bus-stops)| Easy |
61
+
| <spanid="1183">1183</span> |[Maximum Number of Ones](https://leetcode.com/problems/maximum-number-of-ones"矩阵中 1 的最大数量") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/maximum-number-of-ones)| Hard |
62
+
| <spanid="1182">1182</span> |[Shortest Distance to Target Color](https://leetcode.com/problems/shortest-distance-to-target-color"与目标颜色间的最短距离") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-to-target-color)| Medium |
63
+
| <spanid="1181">1181</span> |[Before and After Puzzle](https://leetcode.com/problems/before-and-after-puzzle"前后拼接") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/before-and-after-puzzle)| Medium |
64
+
| <spanid="1180">1180</span> |[Count Substrings with Only One Distinct Letter](https://leetcode.com/problems/count-substrings-with-only-one-distinct-letter"统计只含单一字母的子串") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/count-substrings-with-only-one-distinct-letter)| Easy |
65
+
| <spanid="1179">1179</span> |[Reformat Department Table](https://leetcode.com/problems/reformat-department-table)|[MySQL](https://github.com/openset/leetcode/tree/master/problems/reformat-department-table)| Easy |
57
66
| <spanid="1178">1178</span> |[Number of Valid Words for Each Puzzle](https://leetcode.com/problems/number-of-valid-words-for-each-puzzle"猜字谜")|[Go](https://github.com/openset/leetcode/tree/master/problems/number-of-valid-words-for-each-puzzle)| Hard |
58
67
| <spanid="1177">1177</span> |[Can Make Palindrome from Substring](https://leetcode.com/problems/can-make-palindrome-from-substring"构建回文串检测")|[Go](https://github.com/openset/leetcode/tree/master/problems/can-make-palindrome-from-substring)| Medium |
59
-
| <spanid="1176">1176</span> |[Diet Plan Performance](https://leetcode.com/problems/diet-plan-performance"健身计划评估")|[Go](https://github.com/openset/leetcode/tree/master/problems/diet-plan-performance)| Easy |
68
+
| <spanid="1176">1176</span> |[Diet Plan Performance](https://leetcode.com/problems/diet-plan-performance"健身计划评估")🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/diet-plan-performance)| Easy |
| <spanid="1074">1074</span> |[Number of Submatrices That Sum to Target](https://leetcode.com/problems/number-of-submatrices-that-sum-to-target"元素和为目标值的子矩阵数量")|[Go](https://github.com/openset/leetcode/tree/master/problems/number-of-submatrices-that-sum-to-target)| Hard |
162
171
| <spanid="1073">1073</span> |[Adding Two Negabinary Numbers](https://leetcode.com/problems/adding-two-negabinary-numbers"负二进制数相加")|[Go](https://github.com/openset/leetcode/tree/master/problems/adding-two-negabinary-numbers)| Medium |
163
172
| <spanid="1072">1072</span> |[Flip Columns For Maximum Number of Equal Rows](https://leetcode.com/problems/flip-columns-for-maximum-number-of-equal-rows"按列翻转得到最大值等行数")|[Go](https://github.com/openset/leetcode/tree/master/problems/flip-columns-for-maximum-number-of-equal-rows)| Medium |
164
173
| <spanid="1071">1071</span> |[Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings"字符串的最大公因子")|[Go](https://github.com/openset/leetcode/tree/master/problems/greatest-common-divisor-of-strings)| Easy |
165
174
| <spanid="1070">1070</span> |[Product Sales Analysis III](https://leetcode.com/problems/product-sales-analysis-iii) 🔒 |[MySQL](https://github.com/openset/leetcode/tree/master/problems/product-sales-analysis-iii)| Medium |
| <spanid="1067">1067</span> |[Digit Count in Range](https://leetcode.com/problems/digit-count-in-range"范围内的数字计数") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/digit-count-in-range)| Hard |
169
178
| <spanid="1066">1066</span> |[Campus Bikes II](https://leetcode.com/problems/campus-bikes-ii"校园自行车分配 II") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/campus-bikes-ii)| Medium |
170
179
| <spanid="1065">1065</span> |[Index Pairs of a String](https://leetcode.com/problems/index-pairs-of-a-string"字符串的索引对") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/index-pairs-of-a-string)| Easy |
@@ -295,7 +304,7 @@ LeetCode Problems' Solutions
295
304
| <spanid="940">940</span> |[Distinct Subsequences II](https://leetcode.com/problems/distinct-subsequences-ii"不同的子序列 II")|[Go](https://github.com/openset/leetcode/tree/master/problems/distinct-subsequences-ii)| Hard |
296
305
| <spanid="939">939</span> |[Minimum Area Rectangle](https://leetcode.com/problems/minimum-area-rectangle"最小面积矩形")|[Go](https://github.com/openset/leetcode/tree/master/problems/minimum-area-rectangle)| Medium |
297
306
| <spanid="938">938</span> |[Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst"二叉搜索树的范围和")|[Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-of-bst)| Easy |
| <spanid="937">937</span> |[Reorder Data in Log Files](https://leetcode.com/problems/reorder-data-in-log-files"重新排列日志文件")|[Go](https://github.com/openset/leetcode/tree/master/problems/reorder-data-in-log-files)| Easy |
299
308
| <spanid="936">936</span> |[Stamping The Sequence](https://leetcode.com/problems/stamping-the-sequence"戳印序列")|[Go](https://github.com/openset/leetcode/tree/master/problems/stamping-the-sequence)| Hard |
300
309
| <spanid="935">935</span> |[Knight Dialer](https://leetcode.com/problems/knight-dialer"骑士拨号器")|[Go](https://github.com/openset/leetcode/tree/master/problems/knight-dialer)| Medium |
301
310
| <spanid="934">934</span> |[Shortest Bridge](https://leetcode.com/problems/shortest-bridge"最短的桥")|[Go](https://github.com/openset/leetcode/tree/master/problems/shortest-bridge)| Medium |
[< Previous](https://github.com/openset/leetcode/tree/master/problems/count-substrings-with-only-one-distinct-letter"Count Substrings with Only One Distinct Letter")
9
+
10
+
[Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-to-target-color"Shortest Distance to Target Color")
[< Previous](https://github.com/openset/leetcode/tree/master/problems/distance-between-bus-stops"Distance Between Bus Stops")
9
+
10
+
[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-subarray-sum-with-one-deletion"Maximum Subarray Sum with One Deletion")
11
+
12
+
## 1185. Day of the Week (Easy)
13
+
14
+
<p>Given a date, return the corresponding day of the week for that date.</p>
15
+
16
+
<p>The input is given as three integers representing the <code>day</code>, <code>month</code> and <code>year</code> respectively.</p>
17
+
18
+
<p>Return the answer as one of the following values <code>{"Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday"}</code>.</p>
19
+
20
+
<p> </p>
21
+
<p><strong>Example 1:</strong></p>
22
+
23
+
<pre>
24
+
<strong>Input:</strong> day = 31, month = 8, year = 2019
25
+
<strong>Output:</strong> "Saturday"
26
+
</pre>
27
+
28
+
<p><strong>Example 2:</strong></p>
29
+
30
+
<pre>
31
+
<strong>Input:</strong> day = 18, month = 7, year = 1999
32
+
<strong>Output:</strong> "Sunday"
33
+
</pre>
34
+
35
+
<p><strong>Example 3:</strong></p>
36
+
37
+
<pre>
38
+
<strong>Input:</strong> day = 15, month = 8, year = 1993
39
+
<strong>Output:</strong> "Sunday"
40
+
</pre>
41
+
42
+
<p> </p>
43
+
<p><strong>Constraints:</strong></p>
44
+
45
+
<ul>
46
+
<li>The given dates are valid dates between the years <code>1971</code> and <code>2100</code>.</li>
Copy file name to clipboardExpand all lines: problems/diet-plan-performance/README.md
+2-2
Original file line number
Diff line number
Diff line change
@@ -9,7 +9,7 @@
9
9
10
10
[Next >](https://github.com/openset/leetcode/tree/master/problems/can-make-palindrome-from-substring"Can Make Palindrome from Substring")
11
11
12
-
## 5174. Diet Plan Performance (Easy)
12
+
## 1176. Diet Plan Performance (Easy)
13
13
14
14
<p>A dieter consumes <code>calories[i]</code> calories on the <code>i</code>-th day. For every consecutive sequence of <code>k</code> days, they look at <em>T</em>, the total calories consumed during that sequence of <code>k</code> days:</p>
[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-number-of-ones"Maximum Number of Ones")
9
+
10
+
[Next >](https://github.com/openset/leetcode/tree/master/problems/day-of-the-week"Day of the Week")
11
+
12
+
## 1184. Distance Between Bus Stops (Easy)
13
+
14
+
<p>A bus has <code>n</code> stops numbered from <code>0</code> to <code>n - 1</code> that form a circle. We know the distance between all pairs of neighboring stops where <code>distance[i]</code> is the distance between the stops number <code>i</code> and <code>(i + 1) % n</code>.</p>
15
+
16
+
<p>The bus goes along both directions i.e. clockwise and counterclockwise.</p>
17
+
18
+
<p>Return the shortest distance between the given <code>start</code> and <code>destination</code> stops.</p>
0 commit comments