Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>You have to use a stack for this. </p> <p>Suppose the string is <code>{{1,1},2,{1,1}}</code>.</p> <pre><code>Step 1: Go through the string to determine its depth. </code></pre> <p>You can do this by initializing variables <code>depth =0</code> and <code>maxdepth=depth</code>; Everytime you encounter a '{' increment <code>depth</code> and if <code>depth&gt;maxdepth</code>, <code>maxdepth=depth</code>. If you encounter a '}', decrement <code>depth</code>. </p> <p>The final value of <code>maxdepth</code> will be the depth of the string. In this case <code>maxdepth=2</code>;</p> <pre><code>Step 2: Declare an array items_depth to the depth given by maxdepth. Integer[] items_depth = new Integer[maxdepth+1]; </code></pre> <p><code>items_depth</code> gives the number of items at any depth. Initialize all the elements in <code>items_depth</code> to 0. (Initially there are zero items at any depth). I assume 0 depth as well. So, for depth 2 there will be items at three depths 0,1,2.</p> <pre><code>Step 3: Go through the string again from left to right int depth =0; Stack&lt;Integer&gt; stack = new Stack&lt;Integer&gt;(); while(there are characters in the string) { char i = current character; if(i=='{') { depth++; } if(i is an integer) { items_depth[depth]++; stack.push(Integer.parseInt(i)); } if(i==',') { continue; } if(i=='}') { int temp= items_depth[depth]; int temp_depth = depth; depth--; int temp_sum=0; for(int i=1;i&lt;=items_depth[temp_depth] &amp;&amp; items_depth[temp_depth]&gt;0;i++) { temp_sum+=stack.pop(); } items_depth[temp_depth]=0; stack.push(temp_sum); item_depth[depth]++; } } return stack.pop(); </code></pre> <p>The last item popped from the stack will be the sum of the term with the depths as weight. I assumed a single character int. You have to modify the code to accomodate other ints</p>
    singulars
    1. This table or related slice is empty.
    1. POSum of elements in a nested weighted by their depth
      singulars
      1. PTQuestion
    1. PTAnswer
    1. This table or related slice is empty.
    1. USShikhar Subedi
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. COgive solution for given input which nested list structure. don't assume input as string
      singulars
      1. PO
      1. USRajeev
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload