update 3280

Author: geemaple

README.md

@@ -12,11 +12,11 @@ This is an open-source project that is continually updated
 
 **2023:** 177 problems
 
-**2024:** 256 problems
+**2024:** 257 problems
 
-**Total:** 433 problems
+**Total:** 434 problems
 
-**Updated:** 2024-09-11 15:56:11
+**Updated:** 2024-09-12 14:45:16
 
 ## 链接/Links
 
@@ -88,7 +88,7 @@ python problem.py https://www.lintcode.com/problem/92 -l cpp
 
 ## Math
 
-| Update | Problem(18) | Solution | Tag | Time | Space | Ref |
+| Update | Problem(19) | Solution | Tag | Time | Space | Ref |
 | ----- | ----- | ----- | ----- | ----- | ----- | ----- |
 | 2024-06 | [Leetcode-263. Ugly Number](https://leetcode.com/problems/ugly-number/description/) | [c++](./leetcode/263.ugly-number.cpp), [python3](./leetcode/263.ugly-number.py) | Math | O\(k\) | O\(1\) | - |
 | 2024-06 | [Leetcode-633. Sum Of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers/description/) | [c++](./leetcode/633.sum-of-square-numbers.cpp), [python3](./leetcode/633.sum-of-square-numbers.py) | Math | O\(N\) | O\(1\) | - |
@@ -108,6 +108,7 @@ python problem.py https://www.lintcode.com/problem/92 -l cpp
 | 2024-08 | [Leetcode-50. Powx N](https://leetcode.com/problems/powx-n/description/) | [c++](./leetcode/50.powx-n.cpp), [python3](./leetcode/50.powx-n.py) | Math | O\(logN\) | O\(1\) | - |
 | 2024-09 | [Leetcode-3274. Check If Two Chessboard Squares Have The Same Color](https://leetcode.com/problems/check-if-two-chessboard-squares-have-the-same-color/description/) | [c++](./leetcode/3274.check-if-two-chessboard-squares-have-the-same-color.cpp), [python3](./leetcode/3274.check-if-two-chessboard-squares-have-the-same-color.py) | Math | O\(1\) | O\(1\) | - |
 | 2024-09 | [Leetcode-367. Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/description/) | [c++](./leetcode/367.valid-perfect-square.cpp), [python3](./leetcode/367.valid-perfect-square.py) | Math | O\(logN\) | O\(1\) | - |
+| 2024-09 | [Leetcode-3280. Convert Date To Binary](https://leetcode.com/problems/convert-date-to-binary/description/) | [c++](./leetcode/3280.convert-date-to-binary.cpp), [python3](./leetcode/3280.convert-date-to-binary.py) | Math | O\(1\) | O\(1\) | - |
 
 ## Probability
 

leetcode/3280.convert-date-to-binary.cpp

@@ -0,0 +1,58 @@
+//  Tag: Math, String
+//  Time: O(1)
+//  Space: O(1)
+//  Ref: -
+//  Note: -
+
+//  You are given a string date representing a Gregorian calendar date in the yyyy-mm-dd format.
+//  date can be written in its binary representation obtained by converting year, month, and day to their binary representations without any leading zeroes and writing them down in year-month-day format.
+//  Return the binary representation of date.
+//   
+//  Example 1:
+//  
+//  Input: date = "2080-02-29"
+//  Output: "100000100000-10-11101"
+//  Explanation:
+//  100000100000, 10, and 11101 are the binary representations of 2080, 02, and 29 respectively.
+//  
+//  Example 2:
+//  
+//  Input: date = "1900-01-01"
+//  Output: "11101101100-1-1"
+//  Explanation:
+//  11101101100, 1, and 1 are the binary representations of 1900, 1, and 1 respectively.
+//  
+//   
+//  Constraints:
+//  
+//  date.length == 10
+//  date[4] == date[7] == '-', and all other date[i]'s are digits.
+//  The input is generated such that date represents a valid Gregorian calendar date between Jan 1st, 1900 and Dec 31st, 2100 (both inclusive).
+//  
+//  
+
+class Solution {
+public:
+    string convertDateToBinary(string date) {
+        int number = 0;
+        string res = "";
+        for (auto ch: date) {
+            if (ch == '-') {
+                res += convert(number) + '-';
+                number = 0;
+            } else {
+                number = number * 10 + ch - '0';
+            }
+        }
+        return res + convert(number);
+    }
+
+    string convert(int number) {
+        string res = "";
+        while (number) {
+            res = to_string(number & 1) + res;
+            number = number >> 1;
+        }  
+        return res;
+    }
+};

leetcode/3280.convert-date-to-binary.py

@@ -0,0 +1,45 @@
+#  Tag: Math, String
+#  Time: O(1)
+#  Space: O(1)
+#  Ref: -
+#  Note: -
+
+#  You are given a string date representing a Gregorian calendar date in the yyyy-mm-dd format.
+#  date can be written in its binary representation obtained by converting year, month, and day to their binary representations without any leading zeroes and writing them down in year-month-day format.
+#  Return the binary representation of date.
+#   
+#  Example 1:
+#  
+#  Input: date = "2080-02-29"
+#  Output: "100000100000-10-11101"
+#  Explanation:
+#  100000100000, 10, and 11101 are the binary representations of 2080, 02, and 29 respectively.
+#  
+#  Example 2:
+#  
+#  Input: date = "1900-01-01"
+#  Output: "11101101100-1-1"
+#  Explanation:
+#  11101101100, 1, and 1 are the binary representations of 1900, 1, and 1 respectively.
+#  
+#   
+#  Constraints:
+#  
+#  date.length == 10
+#  date[4] == date[7] == '-', and all other date[i]'s are digits.
+#  The input is generated such that date represents a valid Gregorian calendar date between Jan 1st, 1900 and Dec 31st, 2100 (both inclusive).
+#  
+#  
+
+class Solution:
+    def convertDateToBinary(self, date: str) -> str:
+        return "-".join([self.convert(num) for num in date.split('-')])
+
+    def convert(self, number: str) -> str:
+        number = int(number)
+        res = ''
+        while number > 0:
+            res = str(number & 1) + res
+            number = number >> 1
+
+        return res