update: 添加问题“3280.将日期转换为二进制表示”的代码和题解

Author: LetMeFly666

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

@@ -0,0 +1,22 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-01-01 18:43:56
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-01-01 18:48:09
+ */
+#ifdef _WIN32
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+private:
+    string ten2two(string s) {
+        int a = stoi(s);
+        string temp = bitset<32>(a).to_string();
+        return temp.substr(temp.find('1'));
+    }
+public:
+    string convertDateToBinary(string date) {
+        return ten2two(date.substr(0, 4)) + '-' + ten2two(date.substr(5, 2)) + '-' + ten2two(date.substr(8, 2));
+    }
+};

Codes/3280-convert-date-to-binary.go

@@ -0,0 +1,21 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-01-01 18:54:58
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-01-01 18:57:15
+ */
+package main
+
+import (
+	"strconv"
+	"strings"
+)
+
+func convertDateToBinary(date string) string {
+    a := strings.Split(date, "-")
+    for i := range a {
+        x, _ := strconv.Atoi(a[i])
+        a[i] = strconv.FormatUint(uint64(x), 2)
+    }
+    return strings.Join(a, "-")
+}

Codes/3280-convert-date-to-binary.java

@@ -0,0 +1,15 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-01-01 18:51:17
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-01-01 18:52:45
+ */
+class Solution {
+    public String convertDateToBinary(String date) {
+        String[] a = date.split("-");
+        for (int i = 0; i < a.length; i++) {
+            a[i] = Integer.toBinaryString(Integer.parseInt(a[i]));
+        }
+        return String.join("-", a);
+    }
+}

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

@@ -0,0 +1,9 @@
+'''
+Author: LetMeFly
+Date: 2025-01-01 18:49:00
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-01-01 18:50:23
+'''
+class Solution:
+    def convertDateToBinary(self, date: str) -> str:
+        return '-'.join(bin(int(s))[2:] for s in date.split('-'))

Codes/3280-convert-date-to-binary_convertByHand.cpp

@@ -0,0 +1,29 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-01-01 18:36:02
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-01-01 18:41:24
+ */
+#ifdef _WIN32
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+private:
+    string ten2two(string original) {
+        int ten = 0;
+        for (char c : original) {
+            ten = ten * 10 + c - '0';
+        }
+        string ans;
+        while (ten) {
+            ans = char(ten % 2 + '0') + ans;
+            ten >>= 1;
+        }
+        return ans;
+    }
+public:
+    string convertDateToBinary(string date) {
+        return ten2two(date.substr(0, 4)) + '-' + ten2two(date.substr(5, 2)) + '-' + ten2two(date.substr(8, 2));
+    }
+};

README.md

@@ -753,6 +753,7 @@
 |3259.超级饮料的最大强化能量|中等|<a href="https://leetcode.cn/problems/maximum-energy-boost-from-two-drinks/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/11/01/LeetCode%203259.%E8%B6%85%E7%BA%A7%E9%A5%AE%E6%96%99%E7%9A%84%E6%9C%80%E5%A4%A7%E5%BC%BA%E5%8C%96%E8%83%BD%E9%87%8F/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/143429899" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/maximum-energy-boost-from-two-drinks/solutions/2973620/letmefly-3259chao-ji-yin-liao-de-zui-da-eeusa/" target="_blank">LeetCode题解</a>|
 |3264.K次乘运算后的最终数组I|简单|<a href="https://leetcode.cn/problems/final-array-state-after-k-multiplication-operations-i/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/12/13/LeetCode%203264.K%E6%AC%A1%E4%B9%98%E8%BF%90%E7%AE%97%E5%90%8E%E7%9A%84%E6%9C%80%E7%BB%88%E6%95%B0%E7%BB%84I/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/144442552" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/final-array-state-after-k-multiplication-operations-i/solutions/3018990/letmefly-3264k-ci-cheng-yun-suan-hou-de-ahxh2/" target="_blank">LeetCode题解</a>|
 |3266.K次乘运算后的最终数组II|困难|<a href="https://leetcode.cn/problems/final-array-state-after-k-multiplication-operations-ii/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/12/14/LeetCode%203266.K%E6%AC%A1%E4%B9%98%E8%BF%90%E7%AE%97%E5%90%8E%E7%9A%84%E6%9C%80%E7%BB%88%E6%95%B0%E7%BB%84II/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/144473973" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/final-array-state-after-k-multiplication-operations-ii/solutions/3020166/letmefly-3266k-ci-cheng-yun-suan-hou-de-44xf1/" target="_blank">LeetCode题解</a>|
+|3280.将日期转换为二进制表示|简单|<a href="https://leetcode.cn/problems/convert-date-to-binary/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/01/01/LeetCode%203280.%E5%B0%86%E6%97%A5%E6%9C%9F%E8%BD%AC%E6%8D%A2%E4%B8%BA%E4%BA%8C%E8%BF%9B%E5%88%B6%E8%A1%A8%E7%A4%BA/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/144870892" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/convert-date-to-binary/solutions/3036032/letmefly-3280jiang-ri-qi-zhuan-huan-wei-149mv/" target="_blank">LeetCode题解</a>|
 |3285.找到稳定山的下标|简单|<a href="https://leetcode.cn/problems/find-indices-of-stable-mountains/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/12/19/LeetCode%203285.%E6%89%BE%E5%88%B0%E7%A8%B3%E5%AE%9A%E5%B1%B1%E7%9A%84%E4%B8%8B%E6%A0%87/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/144596618" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-indices-of-stable-mountains/solutions/3025068/letmefly-3285zhao-dao-wen-ding-shan-de-x-u3wc/" target="_blank">LeetCode题解</a>|
 |剑指Offer0047.礼物的最大价值|简单|<a href="https://leetcode.cn/problems/li-wu-de-zui-da-jie-zhi-lcof/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/03/08/LeetCode%20%E5%89%91%E6%8C%87%20Offer%2047.%20%E7%A4%BC%E7%89%A9%E7%9A%84%E6%9C%80%E5%A4%A7%E4%BB%B7%E5%80%BC/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/129408765" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/li-wu-de-zui-da-jie-zhi-lcof/solutions/2155672/letmefly-jian-zhi-offer-47li-wu-de-zui-d-rekb/" target="_blank">LeetCode题解</a>|
 |剑指OfferII0041.滑动窗口的平均值|简单|<a href="https://leetcode.cn/problems/qIsx9U/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/07/16/LeetCode%20%E5%89%91%E6%8C%87%20Offer%20II%200041.%20%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E7%9A%84%E5%B9%B3%E5%9D%87%E5%80%BC/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/125819216" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/qIsx9U/solution/by-tisfy-30mq/" target="_blank">LeetCode题解</a>|

Solutions/LeetCode 3280.将日期转换为二进制表示.md

@@ -0,0 +1,189 @@
+---
+title: 3280.将日期转换为二进制表示
+date: 2025-01-01 18:59:51
+tags: [题解, LeetCode, 简单, 数学, 字符串, 进制转换]
+---
+
+# 【LetMeFly】3280.将日期转换为二进制表示：库函数实现或手动转换
+
+力扣题目链接：[https://leetcode.cn/problems/convert-date-to-binary/](https://leetcode.cn/problems/convert-date-to-binary/)
+
+<p>给你一个字符串 <code>date</code>，它的格式为 <code>yyyy-mm-dd</code>，表示一个公历日期。</p>
+
+<p><code>date</code> 可以重写为二进制表示，只需要将年、月、日分别转换为对应的二进制表示（不带前导零）并遵循 <code>year-month-day</code> 的格式。</p>
+
+<p>返回 <code>date</code> 的 <strong>二进制</strong> 表示。</p>
+
+<p>&nbsp;</p>
+
+<p><strong class="example">示例 1：</strong></p>
+
+<div class="example-block">
+<p><strong>输入：</strong> <span class="example-io">date = "2080-02-29"</span></p>
+
+<p><strong>输出：</strong> <span class="example-io">"100000100000-10-11101"</span></p>
+
+<p><strong>解释：</strong></p>
+
+<p><span class="example-io">100000100000, 10 和 11101 分别是 2080, 02 和 29 的二进制表示。</span></p>
+</div>
+
+<p><strong class="example">示例 2：</strong></p>
+
+<div class="example-block">
+<p><strong>输入：</strong> <span class="example-io">date = "1900-01-01"</span></p>
+
+<p><strong>输出：</strong> <span class="example-io">"11101101100-1-1"</span></p>
+
+<p><strong>解释：</strong></p>
+
+<p><span class="example-io">11101101100, 1 和 1 分别是 1900, 1 和 1 的二进制表示。</span></p>
+</div>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>date.length == 10</code></li>
+	<li><code>date[4] == date[7] == '-'</code>，其余的 <code>date[i]</code> 都是数字。</li>
+	<li>输入保证 <code>date</code> 代表一个有效的公历日期，日期范围从 1900 年 1 月 1 日到 2100 年 12 月 31 日（包括这两天）。</li>
+</ul>
+
+
+    
+## 解题方法：进制转换
+
+如果手动将一个十进制字符串转换为一个二进制字符串，应如何做？
+
+首先将字符串转为十进制数：
+
+> 十进制数初始值为0，遍历字符串，每次十进制数乘以10并加上当前遍历到的字符对应的数字。
+
+接着将十进制数转为二进制字符串：
+
+> 在十进制数不为零时，不断将十进制数对2取模后的结果添加到二进制字符串的头部，然后将十进制数除以2。
+
+当然，现在很多主流的编程语言都有库函数以更加方便地实现。
+
++ 时间复杂度$O(C)$，其中$C=len(s)=10$
++ 空间复杂度$O(C)$
+
+### AC代码
+
+#### C++ - 手动转换版本
+
+```cpp
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-01-01 18:36:02
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-01-01 18:41:24
+ */
+class Solution {
+private:
+    string ten2two(string original) {
+        int ten = 0;
+        for (char c : original) {
+            ten = ten * 10 + c - '0';
+        }
+        string ans;
+        while (ten) {
+            ans = char(ten % 2 + '0') + ans;
+            ten >>= 1;
+        }
+        return ans;
+    }
+public:
+    string convertDateToBinary(string date) {
+        return ten2two(date.substr(0, 4)) + '-' + ten2two(date.substr(5, 2)) + '-' + ten2two(date.substr(8, 2));
+    }
+};
+```
+
+#### C++ - 库函数版本
+
+```cpp
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-01-01 18:43:56
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-01-01 18:48:09
+ */
+class Solution {
+private:
+    string ten2two(string s) {
+        int a = stoi(s);
+        string temp = bitset<32>(a).to_string();
+        return temp.substr(temp.find('1'));
+    }
+public:
+    string convertDateToBinary(string date) {
+        return ten2two(date.substr(0, 4)) + '-' + ten2two(date.substr(5, 2)) + '-' + ten2two(date.substr(8, 2));
+    }
+};
+```
+
+#### Python
+
+```python
+'''
+Author: LetMeFly
+Date: 2025-01-01 18:49:00
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-01-01 18:50:23
+'''
+class Solution:
+    def convertDateToBinary(self, date: str) -> str:
+        return '-'.join(bin(int(s))[2:] for s in date.split('-'))
+```
+
+#### Java
+
+```java
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-01-01 18:51:17
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-01-01 18:52:45
+ */
+class Solution {
+    public String convertDateToBinary(String date) {
+        String[] a = date.split("-");
+        for (int i = 0; i < a.length; i++) {
+            a[i] = Integer.toBinaryString(Integer.parseInt(a[i]));
+        }
+        return String.join("-", a);
+    }
+}
+```
+
+#### Go
+
+```go
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-01-01 18:54:58
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-01-01 18:57:15
+ */
+package main
+
+import (
+	"strconv"
+	"strings"
+)
+
+func convertDateToBinary(date string) string {
+    a := strings.Split(date, "-")
+    for i := range a {
+        x, _ := strconv.Atoi(a[i])
+        a[i] = strconv.FormatUint(uint64(x), 2)
+    }
+    return strings.Join(a, "-")
+}
+```
+
+> 同步发文于CSDN和我的[个人博客](https://blog.letmefly.xyz/)，原创不易，转载经作者同意后请附上[原文链接](https://blog.letmefly.xyz/2025/01/01/LeetCode%203280.%E5%B0%86%E6%97%A5%E6%9C%9F%E8%BD%AC%E6%8D%A2%E4%B8%BA%E4%BA%8C%E8%BF%9B%E5%88%B6%E8%A1%A8%E7%A4%BA/)哦~
+>
+> Tisfy：[https://letmefly.blog.csdn.net/article/details/144870892](https://letmefly.blog.csdn.net/article/details/144870892)

newSolution.py

@@ -2,7 +2,7 @@
 Author: LetMeFly
 Date: 2022-07-03 11:21:14
 LastEditors: LetMeFly.xyz
-LastEditTime: 2024-11-01 12:57:48
+LastEditTime: 2025-01-01 18:35:18
 Command: python newSolution.py 102. 二叉树的层序遍历
 What's more: 当前仅支持数字开头的题目
 '''
@@ -11,6 +11,7 @@
 import sys
 import time
 import datetime
+import subprocess
 from urllib.parse import quote
 
 
@@ -203,4 +204,56 @@ def getProblemUrl():
 print(prResult)
 prNumber = int(prResult.split('/')[-1])
 os.system(f'gh pr merge {prNumber} -m -d')
-os.system(f'cd OtherSource/gitcode_knowledge && git pull && git push Let main:From_GitCode_CSDN')
+# https://github.com/LetMeFly666/LeetCode/blob/3435204860a8a85aa666618d90f40916dc70a1f1/reassign.py
+def syncGitcodeCSDN():
+    nowCWD = os.getcwd()
+    os.chdir('OtherSource/gitcode_knowledge')
+    os.system('git pull')
+    # 判断一个commit是否按配置签名
+    def verify_commit(commit_hash: str) -> bool:
+        result = subprocess.run(
+            ['git', 'verify-commit', commit_hash],
+            stdout=subprocess.PIPE,
+            stderr=subprocess.PIPE,
+        )
+        return not result.returncode
+    # 获取一个commit的上一个commit
+    def get_parent_commit(commit_hash: str) -> str:
+        result = subprocess.run(
+            ['git', 'log', commit_hash, '--pretty=%H', '-n', '2'],
+            stdout=subprocess.PIPE,
+            stderr=subprocess.PIPE,
+        )
+        return result.stdout.decode('utf-8').strip().split()[-1]
+    # 将从某次commit开始至HEAD的所有commit重新签名
+    def re_assign(commit_hash: str) -> None:
+        # cmd = f'git filter-branch -f --commit-filter \'git commit-tree -S "$@";\' {commit_hash}..HEAD'
+        # print(cmd)
+        # os.system(cmd)
+        env = os.environ.copy()
+        env['FILTER_BRANCH_SQUELCH_WARNING'] = "1"
+        result = subprocess.run(
+            ["git", "filter-branch", "-f", "--commit-filter", 'git commit-tree -S "$@";', f"{commit_hash}..HEAD"],
+            env=env,
+        )
+        print(result.returncode)
+        # subprocess.Popen(cmd)
+    def re_assign_main():
+        # re_assign('HEAD~2')
+        # return
+        if verify_commit('HEAD'):  # HEAD的签名也能被验证
+            return
+        notVerified = 'HEAD'
+        while True:
+            next = get_parent_commit(notVerified)
+            if next == notVerified:
+                break
+            notVerified = next
+            if verify_commit(next):
+                break
+        print(notVerified)
+        re_assign(notVerified)
+    os.system('git push --force')  # resign gitcode
+    os.system('git push Let main:From_GitCode_CSDN')
+    os.chdir(nowCWD)
+syncGitcodeCSDN()