2022-03-27 20:37:52 +08:00
< p > Given < code > head< / code > which is a reference node to a singly-linked list. The value of each node in the linked list is either < code > 0< / code > or < code > 1< / code > . The linked list holds the binary representation of a number.< / p >
< p > Return the < em > decimal value< / em > of the number in the linked list.< / p >
2023-12-09 18:42:21 +08:00
< p > The < strong > most significant bit< / strong > is at the head of the linked list.< / p >
2022-03-27 20:37:52 +08:00
< p > < / p >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 1:< / strong > < / p >
2022-03-27 20:37:52 +08:00
< img alt = "" src = "https://assets.leetcode.com/uploads/2019/12/05/graph-1.png" style = "width: 426px; height: 108px;" / >
< pre >
< strong > Input:< / strong > head = [1,0,1]
< strong > Output:< / strong > 5
< strong > Explanation:< / strong > (101) in base 2 = (5) in base 10
< / pre >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 2:< / strong > < / p >
2022-03-27 20:37:52 +08:00
< pre >
< strong > Input:< / strong > head = [0]
< strong > Output:< / strong > 0
< / pre >
< p > < / p >
< p > < strong > Constraints:< / strong > < / p >
< ul >
< li > The Linked List is not empty.< / li >
2023-12-09 18:42:21 +08:00
< li > Number of nodes will not exceed < code > 30< / code > .< / li >
< li > Each node' s value is either < code > 0< / code > or < code > 1< / code > .< / li >
2022-03-27 20:37:52 +08:00
< / ul >