-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathGetDecimalValue.java
More file actions
68 lines (57 loc) · 1.64 KB
/
GetDecimalValue.java
File metadata and controls
68 lines (57 loc) · 1.64 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
/****
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.
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
Example 3:
Input: head = [1]
Output: 1
Example 4:
Input: head = [1,0,0,1,0,0,1,1,1,0,0,0,0,0,0]
Output: 18880
Example 5:
Input: head = [0,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.
Runtime: 1 ms, faster than 19.54% of Java online submissions for Convert Binary Number in a Linked List to Integer.
Memory Usage: 34.1 MB, less than 100.00% of Java online submissions for Convert Binary Number in a Linked List to Integer.
****/
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public int getDecimalValue(ListNode head) {
int out = 0;
Stack<Integer> stack = listToStack(head);
int counter = 0;
while(!stack.empty()) {
int temp = stack.pop();
if(temp == 1) {
out += Math.pow(2, counter);
}
counter ++;
}
return out;
}
private Stack<Integer> listToStack(ListNode head) {
Stack<Integer> stack = new Stack<Integer>();
while(head!=null) {
stack.push(new Integer(head.val));
head = head.next;
}
return stack;
}
}