Skip to content

Commit 658c83b

Browse files
grandyanggrandyang
committed
Update to 1090.
1 parent 92567c8 commit 658c83b

File tree

2 files changed

+81
-0
lines changed

2 files changed

+81
-0
lines changed

‎README-CN.md

+41
Original file line numberDiff line numberDiff line change
@@ -22,6 +22,46 @@ Note: 所有的讲解写在了 GitHub Issue 上面, **请不要在本项目中
2222

2323
| # | Title | Solution | Difficulty |
2424
|---| ----- | -------- | ---------- |
25+
|1090|[Largest Values From Labels](https://github.com/grandyang/leetcode/issues/1090)|60.10%|Medium|
26+
|1089|[Duplicate Zeros](https://github.com/grandyang/leetcode/issues/1089)|51.60%|Easy|
27+
|1088|[Confusing Number II](https://github.com/grandyang/leetcode/issues/1088)|45.60%|Hard|
28+
|1087|Brace Expansion $|63.20%|Medium|
29+
|1086|High Five $|77.50%|Easy|
30+
|1085|Sum of Digits in the Minimum Number $|75.10%|Easy|
31+
|1084|Sales Analysis III * $|54.80%|Easy|
32+
|1083|Sales Analysis II * $|50.80%|Easy|
33+
|1082|Sales Analysis I * $|73.90%|Easy|
34+
|1081|[Smallest Subsequence of Distinct Characters](https://github.com/grandyang/leetcode/issues/1081)|53.60%|Medium|
35+
|1080|[Insufficient Nodes in Root to Leaf Paths](https://github.com/grandyang/leetcode/issues/1080)|50.10%|Medium|
36+
|1079|[Letter Tile Possibilities](https://github.com/grandyang/leetcode/issues/1079)|75.90%|Medium|
37+
|1078|[Occurrences After Bigram](https://github.com/grandyang/leetcode/issues/1078)|65.00%|Easy|
38+
|1077|Project Employees III * $|78.00%|Medium|
39+
|1076|Project Employees II * $|52.80%|Easy|
40+
|1075|Project Employees I * $|66.20%|Easy|
41+
|1074|[Number of Submatrices That Sum to Target](https://github.com/grandyang/leetcode/issues/1074)|62.00%|Hard|
42+
|1073|[Adding Two Negabinary Numbers](https://github.com/grandyang/leetcode/issues/1073)|34.80%|Medium|
43+
|1072|[Flip Columns For Maximum Number of Equal Rows](https://github.com/grandyang/leetcode/issues/1072)|61.60%|Medium|
44+
|1071|[Greatest Common Divisor of Strings](https://github.com/grandyang/leetcode/issues/1071)|51.50%|Easy|
45+
|1070|Product Sales Analysis III * $|49.90%|Medium|
46+
|1069|Product Sales Analysis II * $|83.30%|Easy|
47+
|1068|Product Sales Analysis I * $|82.10%|Easy|
48+
|1067|Digit Count in Range $|41.60%|Hard|
49+
|1066|Campus Bikes II $|54.20%|Medium|
50+
|1065|Index Pairs of a String $|61.00%|Easy|
51+
|1064|Fixed Point $|64.90%|Easy|
52+
|1063|Number of Valid Subarrays $|72.10%|Hard|
53+
|1062|Longest Repeating Substring $|58.40%|Medium|
54+
|1061|Lexicographically Smallest Equivalent String $|66.90%|Medium|
55+
|1060|Missing Element in Sorted Array $|54.80%|Medium|
56+
|1059|All Paths from Source Lead to Destination $|43.00%|Medium|
57+
|1058|Minimize Rounding Error to Meet Target $|43.70%|Medium|
58+
|1057|[Campus Bikes ](https://github.com/grandyang/leetcode/issues/1057) $|57.80%|Medium|
59+
|1056|[Confusing Number ](https://github.com/grandyang/leetcode/issues/1056) $|47.00%|Easy|
60+
|1055|[Shortest Way to Form String ](https://github.com/grandyang/leetcode/issues/1055) $|57.20%|Medium|
61+
|1054|[Distant Barcodes](https://github.com/grandyang/leetcode/issues/1054)|44.20%|Medium|
62+
|1053|[Previous Permutation With One Swap](https://github.com/grandyang/leetcode/issues/1053)|51.20%|Medium|
63+
|1052|[Grumpy Bookstore Owner](https://github.com/grandyang/leetcode/issues/1052)|55.90%|Medium|
64+
|1051|[Height Checker](https://github.com/grandyang/leetcode/issues/1051)|72.10%|Easy|
2565
|1050|Actors and Directors Who Cooperated At Least Three Times * $|72.40%|Easy|
2666
|1049|[Last Stone Weight II](https://github.com/grandyang/leetcode/issues/1049)|45.40%|Medium|
2767
|1048|[Longest String Chain](https://github.com/grandyang/leetcode/issues/1048)|55.50%|Medium|
@@ -1076,6 +1116,7 @@ Note: 所有的讲解写在了 GitHub Issue 上面, **请不要在本项目中
10761116

10771117

10781118

1119+
10791120
<br>
10801121

10811122
## 微信公众号

‎README.md

+40
Original file line numberDiff line numberDiff line change
@@ -23,6 +23,46 @@ Note: All explanations are written in Github Issues, **please do not create any
2323

2424
| # | Title | Solution | Difficulty |
2525
|---| ----- | -------- | ---------- |
26+
|1090|[Largest Values From Labels](https://github.com/grandyang/leetcode/issues/1090)|60.10%|Medium|
27+
|1089|[Duplicate Zeros](https://github.com/grandyang/leetcode/issues/1089)|51.60%|Easy|
28+
|1088|[Confusing Number II](https://github.com/grandyang/leetcode/issues/1088)|45.60%|Hard|
29+
|1087|Brace Expansion $|63.20%|Medium|
30+
|1086|High Five $|77.50%|Easy|
31+
|1085|Sum of Digits in the Minimum Number $|75.10%|Easy|
32+
|1084|Sales Analysis III * $|54.80%|Easy|
33+
|1083|Sales Analysis II * $|50.80%|Easy|
34+
|1082|Sales Analysis I * $|73.90%|Easy|
35+
|1081|[Smallest Subsequence of Distinct Characters](https://github.com/grandyang/leetcode/issues/1081)|53.60%|Medium|
36+
|1080|[Insufficient Nodes in Root to Leaf Paths](https://github.com/grandyang/leetcode/issues/1080)|50.10%|Medium|
37+
|1079|[Letter Tile Possibilities](https://github.com/grandyang/leetcode/issues/1079)|75.90%|Medium|
38+
|1078|[Occurrences After Bigram](https://github.com/grandyang/leetcode/issues/1078)|65.00%|Easy|
39+
|1077|Project Employees III * $|78.00%|Medium|
40+
|1076|Project Employees II * $|52.80%|Easy|
41+
|1075|Project Employees I * $|66.20%|Easy|
42+
|1074|[Number of Submatrices That Sum to Target](https://github.com/grandyang/leetcode/issues/1074)|62.00%|Hard|
43+
|1073|[Adding Two Negabinary Numbers](https://github.com/grandyang/leetcode/issues/1073)|34.80%|Medium|
44+
|1072|[Flip Columns For Maximum Number of Equal Rows](https://github.com/grandyang/leetcode/issues/1072)|61.60%|Medium|
45+
|1071|[Greatest Common Divisor of Strings](https://github.com/grandyang/leetcode/issues/1071)|51.50%|Easy|
46+
|1070|Product Sales Analysis III * $|49.90%|Medium|
47+
|1069|Product Sales Analysis II * $|83.30%|Easy|
48+
|1068|Product Sales Analysis I * $|82.10%|Easy|
49+
|1067|Digit Count in Range $|41.60%|Hard|
50+
|1066|Campus Bikes II $|54.20%|Medium|
51+
|1065|Index Pairs of a String $|61.00%|Easy|
52+
|1064|Fixed Point $|64.90%|Easy|
53+
|1063|Number of Valid Subarrays $|72.10%|Hard|
54+
|1062|Longest Repeating Substring $|58.40%|Medium|
55+
|1061|Lexicographically Smallest Equivalent String $|66.90%|Medium|
56+
|1060|Missing Element in Sorted Array $|54.80%|Medium|
57+
|1059|All Paths from Source Lead to Destination $|43.00%|Medium|
58+
|1058|Minimize Rounding Error to Meet Target $|43.70%|Medium|
59+
|1057|[Campus Bikes ](https://github.com/grandyang/leetcode/issues/1057) $|57.80%|Medium|
60+
|1056|[Confusing Number ](https://github.com/grandyang/leetcode/issues/1056) $|47.00%|Easy|
61+
|1055|[Shortest Way to Form String ](https://github.com/grandyang/leetcode/issues/1055) $|57.20%|Medium|
62+
|1054|[Distant Barcodes](https://github.com/grandyang/leetcode/issues/1054)|44.20%|Medium|
63+
|1053|[Previous Permutation With One Swap](https://github.com/grandyang/leetcode/issues/1053)|51.20%|Medium|
64+
|1052|[Grumpy Bookstore Owner](https://github.com/grandyang/leetcode/issues/1052)|55.90%|Medium|
65+
|1051|[Height Checker](https://github.com/grandyang/leetcode/issues/1051)|72.10%|Easy|
2666
|1050|Actors and Directors Who Cooperated At Least Three Times * $|72.40%|Easy|
2767
|1049|[Last Stone Weight II](https://github.com/grandyang/leetcode/issues/1049)|45.40%|Medium|
2868
|1048|[Longest String Chain](https://github.com/grandyang/leetcode/issues/1048)|55.50%|Medium|

0 commit comments

Comments
 (0)