Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>Actually, you declare an int[] array with the capacity as <code>Math.max(num1.length, num2.length)</code>.</p> <p><strong><code>It is not encough. You should set the capacity as Math.max(num1.length, num2.length) +1.</code></strong></p> <p><strong>Why?</strong></p> <p>See if num1 is <code>{1,9,9,9}</code> and num2 is <code>{9,9,9,9}</code>, <strong>how can the arraySum to represent the sum {1,1,9,9,8}?</strong></p> <p>So we need to declare it as below to consider if <strong>carry</strong> is needed.</p> <pre><code> int[] arraySum = new int[capacity + 1]; </code></pre> <p>Then when print the sum, check if arraySum[0] is 0 or 1, if it euqals to 0, do not print it in Console.</p> <p><strong>Modified code for reference is as follows:</strong></p> <p>package question;</p> <pre><code>public class Example { public static void main(String[] args) { // for the same lengths int[] num1 = { 1,9,9,9 }; int[] num2 = { 9,9,9,9};// {9,9,9} // 1999+9999 = 11998, its length is greater than the max int capacity = Math.max(num1.length, num2.length); int[] arraySum = new int[capacity + 1]; int len2 = num2.length; int len1 = num1.length; if (len1 &lt; len2) { int lengthDiff = len2 - len1; /* * Flag for checking if carry is needed. */ boolean needCarry = false; for (int i = len1 - 1; i &gt;= 0; i--) { /** * Start with the biggest index */ int sumPerPosition =0; if (needCarry) { sumPerPosition = num1[i] + num2[i + lengthDiff] +1; needCarry = false; }else { sumPerPosition = num1[i] + num2[i + lengthDiff]; } if (sumPerPosition &gt; 9) { arraySum[i + lengthDiff + 1] = sumPerPosition % 10; needCarry = true; }else { arraySum[i + lengthDiff + 1] = sumPerPosition % 10; } } /** * Handle the remaining part in nun2 Array */ for (int i = lengthDiff - 1; i &gt;= 0; i--) { /* * Do not need to care num1 Array Here now */ if(needCarry){ arraySum[i + 1] = num2[i]+1; }else { arraySum[i + 1] = num1[i] ; } if (arraySum[i + 1] &gt; 9) { arraySum[i + 1] = arraySum[i + 1] % 10; needCarry = true; } else { needCarry = false; } } /* * Handle the last number, if carry is needed. set it to 1, else set * it to 0 */ if (needCarry) { arraySum[0] = 1; } else { arraySum[0] = 0; } } else { int lengthDiff = len1 - len2; /* * Flag for checking if carry is needed. */ boolean needCarry = false; for (int i = len2 - 1; i &gt;= 0; i--) { /** * Start with the biggest index */ int sumPerPosition = 0; if (needCarry) { sumPerPosition = num2[i] + num1[i + lengthDiff] +1; needCarry = false; }else { sumPerPosition = num2[i] + num1[i + lengthDiff]; } if (sumPerPosition &gt; 9) { arraySum[i + lengthDiff + 1] = sumPerPosition % 10; needCarry = true; }else { arraySum[i + lengthDiff + 1] = sumPerPosition % 10; } } /** * Handle the remaining part in nun2 Array */ for (int i = lengthDiff - 1; i &gt;= 0; i--) { /* * Do not need to care num1 Array Here now */ if(needCarry){ arraySum[i + 1] = num1[i]+1; }else { arraySum[i + 1] = num1[i] ; } if (arraySum[i + 1] &gt; 9) { arraySum[i + 1] = arraySum[i + 1] % 10; needCarry = true; } else { needCarry = false; } } /* * Handle the last number, if carry is needed. set it to 1, else set * it to 0 */ if (needCarry) { arraySum[0] = 1; } else { arraySum[0] = 0; } } /* * Print sum * * if arraySum[0] ==1, print 1 * * Do not print 0 when arraySum[0] ==0 */ if(arraySum[0] == 1) { System.out.print(1); } for (int i = 1; i &lt; arraySum.length; i++) { System.out.print(arraySum[i]); } } } </code></pre> <p>An example that num1 is {1,9,9,9} and num2 is {9,9,9,9}, the sum result is as follows:</p> <p><strong>output in Console:</strong></p> <pre><code>11998 </code></pre>
    singulars
    1. This table or related slice is empty.
    1. POJava: How to sum the elements of two arrays with different lengths
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USMouseLearnJava
    1. USMouseLearnJava
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POJava: How to sum the elements of two arrays with different lengths
      singulars
      1. PTQuestion
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTAcceptedByOriginator
    1. COThere is something wrong with the carry. If I change the arrays' lengths and their elements, the output is wrong but it is pretty close. Let's say, num1{1,2} + num2{1,1,0}. The output should be 121, but it becomes 100...
      singulars
      1. PO
      1. UScoding
    2. COUpdated the code. In your example num1{1,2} + num2{1,1,0}. Its output should be 122. :)
      singulars
      1. PO
      1. USMouseLearnJava
    3. COThanks for the update. It works now.
      singulars
      1. PO
      1. USMouseLearnJava
 

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