-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathleetcode_1290.cpp
More file actions
86 lines (69 loc) · 1.74 KB
/
leetcode_1290.cpp
File metadata and controls
86 lines (69 loc) · 1.74 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
// 1290. Convert Binary Number in a Linked List to Integer
// link - https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/description
/*
Given head which is a reference node to a singly-linked list. The value of each node in the linked list is either 0 or 1. The linked list holds the binary representation of a number.
Return the decimal value of the number in the linked list.
The most significant bit is at the head of the linked list.
Example 1:
Input: head = [1,0,1]
Output: 5
Explanation: (101) in base 2 = (5) in base 10
Example 2:
Input: head = [0]
Output: 0
Constraints:
The Linked List is not empty.
Number of nodes will not exceed 30.
Each node's value is either 0 or 1.
*/
#include <iostream>
using namespace std;
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) {}
};
/**
* 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)
{
if (!head)
return -1;
int ans = 0;
while (head)
{
ans <<= 1;
ans |= head->val & 1;
head = head->next;
}
return ans;
}
};
int main()
{
// Example: head = [1,0,1]
ListNode *n3 = new ListNode(1);
ListNode *n2 = new ListNode(0, n3);
ListNode *n1 = new ListNode(1, n2);
Solution sol;
cout << "Decimal value: " << sol.getDecimalValue(n1) << endl; // Output: 5
// Clean up
delete n1;
delete n2;
delete n3;
return 0;
}