Commit 9857fee

committed

add two revers no in array

1 parent 0cba874 commit 9857feeCopy full SHA for 9857fee

File tree

10 files changed

+35

-512

lines changed

.idea
- .gitignore
- kotlinc.xml
- libraries
  - KotlinJavaRuntime.xml
- misc.xml
- modules.xml
- other.xml
- uiDesigner.xml
- vcs.xml
out/production/LeetCode_DSA_Problem/kotlin_problem
- TwoArraySum.class
src/main/problems/kotlin_problem
- TwoArraySum.kt

10 files changed

+35

-512

lines changed

`‎.idea/.gitignore`

Lines changed: 0 additions & 3 deletions

This file was deleted.

`‎.idea/kotlinc.xml`

Lines changed: 0 additions & 10 deletions

This file was deleted.

`‎.idea/libraries/KotlinJavaRuntime.xml`

Lines changed: 0 additions & 26 deletions

This file was deleted.

`‎.idea/misc.xml`

Lines changed: 0 additions & 6 deletions

This file was deleted.

`‎.idea/modules.xml`

Lines changed: 0 additions & 8 deletions

This file was deleted.

`‎.idea/other.xml`

Lines changed: 0 additions & 329 deletions

This file was deleted.

`‎.idea/uiDesigner.xml`

Lines changed: 0 additions & 124 deletions

This file was deleted.

`‎.idea/vcs.xml`

Lines changed: 0 additions & 6 deletions

This file was deleted.

`‎out/production/LeetCode_DSA_Problem/kotlin_problem/TwoArraySum.class`

2.06 KB

Binary file not shown.

`‎src/main/problems/kotlin_problem/TwoArraySum.kt`

Lines changed: 35 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,35 @@`
	`1`	`+package kotlin_problem`
	`2`	`+`
	`3`	`+/*`
	`4`	`+* oding problem 2`
	`5`	`+2 input lists / array , which have numbers stored in reverse .`
	`6`	`+* for eg 342 is stored as L1 = [2,4,3] and 465 is stored as L2= [5,6,4] .`
	`7`	`+* Please create a new array which has 342 + 465 = 807 stored as [7,0,8] .`
	`8`	`+* */`
	`9`	`+object TwoArraySum {`
	`10`	`+ @JvmStatic`
	`11`	`+ fun main(args: Array<String>) {`
	`12`	`+ val l1 = intArrayOf(2, 4, 3)`
	`13`	`+ val l2 = intArrayOf(5, 6, 9)`
	`14`	`+ var l3 = mutableListOf<Int>()`
	`15`	`+ var carry = 0`
	`16`	`+ val n = maxOf(l1.size, l2.size)`
	`17`	`+ var i = 0`
	`18`	`+ while (i < n) {`
	`19`	`+ val value1 = if (i < l1.size) l1[i] else 0`
	`20`	`+ val value2 = if (i < l2.size) l2[i] else 0`
	`21`	`+ var sum = value1 + value2 + carry`
	`22`	`+ if (sum >= 10) {`
	`23`	`+ carry = sum / 10`
	`24`	`+ sum = sum % 10`
	`25`	`+ }`
	`26`	`+ l3.add(sum)`
	`27`	`+ i++`
	`28`	`+ }`
	`29`	`+ if (carry != 0)`
	`30`	`+ l3.add(carry)`
	`31`	`+ l3.toIntArray()`
	`32`	`+ println(l3)`
	`33`	`+ println(l3.asReversed())`
	`34`	`+ }`
	`35`	`+}`

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit 9857fee

File tree

10 files changed

10 files changed

`‎.idea/.gitignore`

`‎.idea/kotlinc.xml`

`‎.idea/libraries/KotlinJavaRuntime.xml`

`‎.idea/misc.xml`

`‎.idea/modules.xml`

`‎.idea/other.xml`

`‎.idea/uiDesigner.xml`

`‎.idea/vcs.xml`

`‎out/production/LeetCode_DSA_Problem/kotlin_problem/TwoArraySum.class`

`‎src/main/problems/kotlin_problem/TwoArraySum.kt`

0 commit comments