update: 添加问题“1290.二进制链表转整数”的代码和题解(#1027)

LetMeFly666 · web-flow · commit 32eb95435420 · 2025-07-14T23:58:37.000+08:00
* fix: 昨晚消失的commit Signed-off-by: LetMeFly666 <814114971@qq.com> * docs: en MacOS上忘记push了一个commit - 准备手动merge吧 * temp: windows+MacOS * init+rollback: true hash (#1026) c2a5f47 * 1290: AC.cpp+py+java+go (#1026) cpp - AC,100.00%,5.35% py - AC,100.00%,79.56% java - AC,100.00%,5.95% go - AC,100.00%,92.52% * update: 添加问题“1290.二进制链表转整数”的代码和题解(#1027) Signed-off-by: LetMeFly666 <814114971@qq.com> * fix: 完美一点 (#1026) #1027 (review) --------- Signed-off-by: LetMeFly666 <814114971@qq.com>
diff --git a/Codes/1290-convert-binary-number-in-a-linked-list-to-integer.cpp b/Codes/1290-convert-binary-number-in-a-linked-list-to-integer.cpp
@@ -0,0 +1,31 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-07-14 23:37:54
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-07-14 23:42:31
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+/**
+ * Definition for singly-linked list.
+ * struct ListNode {
+ *     int val;
+ *     ListNode *next;
+ *     ListNode() : val(0), next(nullptr) {}
+ *     ListNode(int x) : val(x), next(nullptr) {}
+ *     ListNode(int x, ListNode *next) : val(x), next(next) {}
+ * };
+ */
+class Solution {
+public:
+    int getDecimalValue(ListNode* head) {
+        int ans = 0;
+        while (head) {
+            ans = ans * 2 + head->val;
+            head = head->next;
+        }
+        return ans;
+    }
+};
diff --git a/Codes/1290-convert-binary-number-in-a-linked-list-to-integer.go b/Codes/1290-convert-binary-number-in-a-linked-list-to-integer.go
@@ -0,0 +1,21 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-07-14 23:37:54
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-07-14 23:47:42
+ */
+package main
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ *     Val int
+ *     Next *ListNode
+ * }
+ */
+func getDecimalValue(head *ListNode) (ans int) {
+    for ; head != nil; head = head.Next {
+        ans = ans * 2 + head.Val
+    }
+    return
+}
diff --git a/Codes/1290-convert-binary-number-in-a-linked-list-to-integer.java b/Codes/1290-convert-binary-number-in-a-linked-list-to-integer.java
@@ -0,0 +1,26 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-07-14 23:37:54
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-07-14 23:45:19
+ */
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+class Solution {
+    public int getDecimalValue(ListNode head) {
+        int ans = 0;
+        while (head != null) {
+            ans = ans * 2 + head.val;
+            head = head.next;
+        }
+        return ans;
+    }
+}
diff --git a/Codes/1290-convert-binary-number-in-a-linked-list-to-integer.py b/Codes/1290-convert-binary-number-in-a-linked-list-to-integer.py
@@ -0,0 +1,21 @@
+'''
+Author: LetMeFly
+Date: 2025-07-14 23:37:54
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-07-14 23:43:59
+'''
+from typing import Optional
+
+# # Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
+
+class Solution:
+    def getDecimalValue(self, head: Optional[ListNode]) -> int:
+        ans = 0
+        while head:
+            ans = ans * 2 + head.val
+            head = head.next
+        return ans
diff --git a/README.md b/README.md
@@ -508,6 +508,7 @@
 |1282.用户分组|中等|<a href="https://leetcode.cn/problems/group-the-people-given-the-group-size-they-belong-to/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/08/12/LeetCode%201282.%E7%94%A8%E6%88%B7%E5%88%86%E7%BB%84/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/126298148" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/group-the-people-given-the-group-size-they-belong-to/solution/letmefly-1282yong-hu-fen-zu-by-tisfy-9h94/" target="_blank">LeetCode题解</a>|
 |1287.有序数组中出现次数超过25%的元素|简单|<a href="https://leetcode.cn/problems/element-appearing-more-than-25-in-sorted-array/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/02/17/LeetCode%201287.%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E5%87%BA%E7%8E%B0%E6%AC%A1%E6%95%B0%E8%B6%85%E8%BF%8725%E7%9A%84%E5%85%83%E7%B4%A0" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/145683090" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/element-appearing-more-than-25-in-sorted-array/solutions/3078136/letmefly-1287you-xu-shu-zu-zhong-chu-xia-wdat/" target="_blank">LeetCode题解</a>|
 |1289.下降路径最小和II|困难|<a href="https://leetcode.cn/problems/minimum-falling-path-sum-ii/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/08/10/LeetCode%201289.%E4%B8%8B%E9%99%8D%E8%B7%AF%E5%BE%84%E6%9C%80%E5%B0%8F%E5%92%8CII/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/132201281" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/minimum-falling-path-sum-ii/solutions/2381173/letmefly-1289xia-jiang-lu-jing-zui-xiao-kt8cj/" target="_blank">LeetCode题解</a>|
+|1290.二进制链表转整数|简单|<a href="https://leetcode.cn/problems/convert-binary-number-in-a-linked-list-to-integer/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/07/14/LeetCode%201290.%E4%BA%8C%E8%BF%9B%E5%88%B6%E9%93%BE%E8%A1%A8%E8%BD%AC%E6%95%B4%E6%95%B0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/149342077" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/convert-binary-number-in-a-linked-list-to-integer/solutions/3723954/letmefly-1290er-jin-zhi-lian-biao-zhuan-adolg/" target="_blank">LeetCode题解</a>|
 |1295.统计位数为偶数的数字|简单|<a href="https://leetcode.cn/problems/find-numbers-with-even-number-of-digits/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/04/30/LeetCode%201295.%E7%BB%9F%E8%AE%A1%E4%BD%8D%E6%95%B0%E4%B8%BA%E5%81%B6%E6%95%B0%E7%9A%84%E6%95%B0%E5%AD%97/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/147637587" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-numbers-with-even-number-of-digits/solutions/3666390/letmefly-1295tong-ji-wei-shu-wei-ou-shu-bwhfr/" target="_blank">LeetCode题解</a>|
 |1299.将每个元素替换为右侧最大元素|简单|<a href="https://leetcode.cn/problems/replace-elements-with-greatest-element-on-right-side/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/02/16/LeetCode%201299.%E5%B0%86%E6%AF%8F%E4%B8%AA%E5%85%83%E7%B4%A0%E6%9B%BF%E6%8D%A2%E4%B8%BA%E5%8F%B3%E4%BE%A7%E6%9C%80%E5%A4%A7%E5%85%83%E7%B4%A0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/145661909" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/replace-elements-with-greatest-element-on-right-side/solutions/3076497/letmefly-1299jiang-mei-ge-yuan-su-ti-hua-4y58/" target="_blank">LeetCode题解</a>|
 |1302.层数最深叶子节点的和|中等|<a href="https://leetcode.cn/problems/deepest-leaves-sum/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/08/17/LeetCode%201302.%E5%B1%82%E6%95%B0%E6%9C%80%E6%B7%B1%E5%8F%B6%E5%AD%90%E8%8A%82%E7%82%B9%E7%9A%84%E5%92%8C/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/126377912" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/deepest-leaves-sum/solution/letmefly-1302ceng-shu-zui-shen-xie-zi-ji-eyu0/" target="_blank">LeetCode题解</a>|
diff --git a/Solutions/LeetCode 1290.二进制链表转整数.md b/Solutions/LeetCode 1290.二进制链表转整数.md
@@ -0,0 +1,196 @@
+---
+title: 1290.二进制链表转整数：链表+进制转换
+date: 2025-07-14 23:48:16
+tags: [题解, LeetCode, 简单, 链表, 数学, 进制, 二进制, 进制转换]
+categories: [题解, LeetCode]
+index_img: http://assets.leetcode.cn/aliyun-lc-upload/uploads/2019/12/15/graph-1.png
+---
+
+# 【LetMeFly】1290.二进制链表转整数：链表+进制转换
+
+力扣题目链接：[https://leetcode.cn/problems/convert-binary-number-in-a-linked-list-to-integer/](https://leetcode.cn/problems/convert-binary-number-in-a-linked-list-to-integer/)
+
+<p>给你一个单链表的引用结点&nbsp;<code>head</code>。链表中每个结点的值不是 0 就是 1。已知此链表是一个整数数字的二进制表示形式。</p>
+
+<p>请你返回该链表所表示数字的 <strong>十进制值</strong> 。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/12/15/graph-1.png" style="height: 108px; width: 426px;"></p>
+
+<pre><strong>输入：</strong>head = [1,0,1]
+<strong>输出：</strong>5
+<strong>解释：</strong>二进制数 (101) 转化为十进制数 (5)
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre><strong>输入：</strong>head = [0]
+<strong>输出：</strong>0
+</pre>
+
+<p><strong>示例 3：</strong></p>
+
+<pre><strong>输入：</strong>head = [1]
+<strong>输出：</strong>1
+</pre>
+
+<p><strong>示例 4：</strong></p>
+
+<pre><strong>输入：</strong>head = [1,0,0,1,0,0,1,1,1,0,0,0,0,0,0]
+<strong>输出：</strong>18880
+</pre>
+
+<p><strong>示例 5：</strong></p>
+
+<pre><strong>输入：</strong>head = [0,0]
+<strong>输出：</strong>0
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li>链表不为空。</li>
+	<li>链表的结点总数不超过&nbsp;<code>30</code>。</li>
+	<li>每个结点的值不是&nbsp;<code>0</code> 就是 <code>1</code>。</li>
+</ul>
+
+
+    
+## 解题方法：进制转换
+
+二进制如何转为十进制？
+
+初始值$ans = 0$，遍历二进制数字，并令$ans\times 2+当前二进制位$
+
++ 时间复杂度$O(len(list))$
++ 空间复杂度$O(1)$
+
+### AC代码
+
+#### C++
+
+```cpp
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-07-14 23:37:54
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-07-14 23:42:31
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+/**
+ * Definition for singly-linked list.
+ * struct ListNode {
+ *     int val;
+ *     ListNode *next;
+ *     ListNode() : val(0), next(nullptr) {}
+ *     ListNode(int x) : val(x), next(nullptr) {}
+ *     ListNode(int x, ListNode *next) : val(x), next(next) {}
+ * };
+ */
+class Solution {
+public:
+    int getDecimalValue(ListNode* head) {
+        int ans = 0;
+        while (head) {
+            ans = ans * 2 + head->val;
+            head = head->next;
+        }
+        return ans;
+    }
+};
+```
+
+#### Python
+
+```python
+'''
+Author: LetMeFly
+Date: 2025-07-14 23:37:54
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-07-14 23:43:59
+'''
+from typing import Optional
+
+# # Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
+
+class Solution:
+    def getDecimalValue(self, head: Optional[ListNode]) -> int:
+        ans = 0
+        while head:
+            ans = ans * 2 + head.val
+            head = head.next
+        return ans
+```
+
+#### Java
+
+```java
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-07-14 23:37:54
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-07-14 23:45:19
+ */
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+class Solution {
+    public int getDecimalValue(ListNode head) {
+        int ans = 0;
+        while (head != null) {
+            ans = ans * 2 + head.val;
+            head = head.next;
+        }
+        return ans;
+    }
+}
+```
+
+#### Go
+
+```go
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-07-14 23:37:54
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-07-14 23:47:42
+ */
+package main
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ *     Val int
+ *     Next *ListNode
+ * }
+ */
+func getDecimalValue(head *ListNode) (ans int) {
+    for ; head != nil; head = head.Next {
+        ans = ans * 2 + head.Val
+    }
+    return
+}
+```
+
+> 同步发文于[CSDN](https://letmefly.blog.csdn.net/article/details/149342077)和我的[个人博客](https://blog.letmefly.xyz/)，原创不易，转载经作者同意后请附上[原文链接](https://blog.letmefly.xyz/2025/07/14/LeetCode%201290.%E4%BA%8C%E8%BF%9B%E5%88%B6%E9%93%BE%E8%A1%A8%E8%BD%AC%E6%95%B4%E6%95%B0/)哦~
+>
+> 千篇源码题解[已开源](https://github.com/LetMeFly666/LeetCode)
diff --git a/Solutions/LeetCode 3439.重新安排会议得到最多空余时间I.md b/Solutions/LeetCode 3439.重新安排会议得到最多空余时间I.md
@@ -3,6 +3,7 @@ title: 3439.重新安排会议得到最多空余时间 I：贪心(滑动窗口)
 date: 2025-07-13 22:23:38
 tags: [题解, LeetCode, 中等, 贪心, 数组, 滑动窗口]
 categories: [题解, LeetCode]
+index_img: https://assets.leetcode.com/uploads/2024/12/21/example0_rescheduled.png
 ---
 
 # 【LetMeFly】3439.重新安排会议得到最多空余时间 I：贪心(滑动窗口) - 连开k场会议
@@ -82,11 +83,11 @@ categories: [题解, LeetCode]
 
 ### 解题思路
 
-怎么尽可能出现“最大间隙”？当然是尽可能地把会放到一块开。
+怎么尽可能出现“最大间隙”？当然是尽可能地把会议放到一块开。
 
 > 题外话：长痛不如短痛，一下连着把课上了然后连着放个长假挺好的。
 
-但是，我们最多调整k个会议的时间。怎么调？选连续的k个挤到一块呗（把当前选中的4个放到<span title="或0">上次会议的end</span>之后紧挨着）。
+但是，我们最多调整k个会议的时间。怎么调？选连续的k个挤到一块呗（把当前选中的k个放到<span title="或0">上次会议的end</span>之后紧挨着）。
 
 每次把连续的$k$个会议往前调后，k场会议中最后一个的结束时间和<span title="或eventTime">下一场会议的start</span>之间的间隔即为调整这k个会议的情况下所能营造的最长连续间隔。
 
diff --git a/Solutions/Other-English-LearningNotes-SomeWords.md b/Solutions/Other-English-LearningNotes-SomeWords.md
@@ -464,7 +464,7 @@ categories: [自用]
 |amiable|adj. 和蔼可亲的，亲切友好的|
 |plump|adj. 丰满的，丰腴的，胖乎乎的，饱满的<br/>v. (拍打坐垫等)使蓬松，猛地摔下，重重的坐下<br/>n. 突然前冲，种种坠落|
 |miscarriage|n. 流产|
-|<font color="#28bea0" title="二次复习">sullen</font>|adj. 闷闷不乐的，郁郁寡欢的，(天空/天气)阴沉的|
+|<font color="#28bea0" title="三次复习">sullen</font>|adj. 闷闷不乐的，郁郁寡欢的，(天空/天气)阴沉的|
 |||
 |carpenter|n. 木匠，木工<br/>v. 以木工手艺造/修(家具/器物)|
 |||
diff --git a/en.md b/en.md
@@ -0,0 +1,9 @@
+<!--
+ * @Author: LetMeFly
+ * @Date: 2025-07-14 23:30:43
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-07-14 23:58:06
+-->
+|bulletin|n. 公告，告示；新闻快报；简报|
+|stevedore|n. 码头工人<br/>装船卸货|
+|tar|n. 焦油，沥青<br/>用沥青抹，用柏油涂<br/>adj. 涂油柏油的|
