We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 07e254f commit a1fa282Copy full SHA for a1fa282
leetcode/cpp/linkedlist/1290.cpp
@@ -0,0 +1,28 @@
1
+/**
2
+ * Definition for singly-linked list.
3
+ * struct ListNode {
4
+ * int val;
5
+ * ListNode *next;
6
+ * ListNode() : val(0), next(nullptr) {}
7
+ * ListNode(int x) : val(x), next(nullptr) {}
8
+ * ListNode(int x, ListNode *next) : val(x), next(next) {}
9
+ * };
10
+ */
11
+class Solution {
12
+public:
13
+ int getDecimalValue(ListNode* head) {
14
+ int answer = 0;
15
+ vector<int> v;
16
+ while(head){
17
+ v.push_back(head->val);
18
+ head = head->next;
19
+ }
20
+ reverse(v.begin(),v.end());
21
+ for (int i = 0; i < v.size(); i++)
22
+ if(v.at(i))
23
+ answer += pow(2,i);
24
+ return answer;
25
26
+};
27
+
28
0 commit comments