mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 19:53:12 +08:00
49 lines
1.3 KiB
HTML
49 lines
1.3 KiB
HTML
<p>给你一个单链表的引用结点 <code>head</code>。链表中每个结点的值不是 0 就是 1。已知此链表是一个整数数字的二进制表示形式。</p>
|
||
|
||
<p>请你返回该链表所表示数字的 <strong>十进制值</strong> 。</p>
|
||
|
||
<p> </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> </p>
|
||
|
||
<p><strong>提示：</strong></p>
|
||
|
||
<ul>
|
||
<li>链表不为空。</li>
|
||
<li>链表的结点总数不超过 <code>30</code>。</li>
|
||
<li>每个结点的值不是 <code>0</code> 就是 <code>1</code>。</li>
|
||
</ul>
|