-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathnested_list_bkp_not_working.java
More file actions
78 lines (64 loc) · 2.23 KB
/
Copy pathnested_list_bkp_not_working.java
File metadata and controls
78 lines (64 loc) · 2.23 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
/**
* // This is the interface that allows for creating nested lists.
* // You should not implement it, or speculate about its implementation
* public interface NestedInteger {
* // Constructor initializes an empty nested list.
* public NestedInteger();
*
* // Constructor initializes a single integer.
* public NestedInteger(int value);
*
* // @return true if this NestedInteger holds a single integer, rather than a nested list.
* public boolean isInteger();
*
* // @return the single integer that this NestedInteger holds, if it holds a single integer
* // Return null if this NestedInteger holds a nested list
* public Integer getInteger();
*
* // Set this NestedInteger to hold a single integer.
* public void setInteger(int value);
*
* // Set this NestedInteger to hold a nested list and adds a nested integer to it.
* public void add(NestedInteger ni);
*
* // @return the nested list that this NestedInteger holds, if it holds a nested list
* // Return null if this NestedInteger holds a single integer
* public List<NestedInteger> getList();
* }
*/
class Solution {
public int depthSum(List<NestedInteger> nestedList) {
int ans=0,d=1;
List<NestedInteger> t = new ArrayList<NestedInteger>();
List<Integer> flg = new ArrayList<Integer>();
int f=0;
do
{
for(int i=0;i<nestedList.size();i++)
{
if(nestedList.get(i).isInteger())
{
int y = nestedList.get(i).getInteger();
ans+=(d*y);
}
else
{
t.add(nestedList.get(i));
++f;
}
}
int g = flg.get(0);
if(t.size() == g)
{
flg.add(f);
f=0;
++d;
flg.remove(0);
}
nestedList = new ArrayList<NestedInteger>();
nestedList.add(t.get(0));
t.remove(0);
}while(t.size()>0);
return ans;
}
}