-
Notifications
You must be signed in to change notification settings - Fork 0
/
038_BinaryLinkedListToInteger.cpp
60 lines (50 loc) · 1.14 KB
/
038_BinaryLinkedListToInteger.cpp
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
/************************************************************
Following is the linkedList class structure:
class Node {
public:
int data;
Node *next;
Node(int val) {
this->data = val;
next = NULL;
}
~Node() {
if (next != NULL) {
delete next;
}
}
};
************************************************************/
#include<bits/stdc++.h>
using namespace std;
class Node {
public:
int data;
Node *next;
Node(int val) {
this->data = val;
next = NULL;
}
~Node() {
if (next != NULL) {
delete next;
}
}
};
int binaryToInteger(int n, Node *head) {
// Write your code here
Node *temp = head;
int num = 0;
// for(int i=n-1; i>=0 && temp; i--){
// int curr= pow(2, i) * temp->data;
// num += curr;
// temp = temp->next;
// }
while (head != NULL) {
num *= 2;
num += head->data;
// Move to the next node.
head = head->next;
}
return num;
}