Commit2a30677

authored

Merge pull requestneetcode-gh#192 from GaneshanNT/main

Java solution added for Linked List problems

2 parentsda20ac9 +85f3589 commit2a30677Copy full SHA for 2a30677

File tree

+49

-0

lines changed

+49

-0

lines changed

Lines changed: 49 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,49 @@`
	`1`	`+/*`
	`2`	`+ Name - Add Two Numbers`
	`3`	`+ Link - https://leetcode.com/problems/add-two-numbers/`
	`4`	`+ Time Complexity - O(m + n)`
	`5`	`+ Space Complexity - o(1)`
	`6`	`+ Note - make use of modulo (get remainder) and division (get quotient)`
	`7`	`+*/`
	`8`	`+`
	`9`	`+classSolution {`
	`10`	`+publicListNodeaddTwoNumbers(ListNodefirst,ListNodesecond) {`
	`11`	`+intq =0;`
	`12`	`+intr =0;`
	`13`	`+intsum =0;`
	`14`	`+ListNodehead =null;`
	`15`	`+ListNodetemp =null;`
	`16`	`+while (first !=null \|\|second !=null) {`
	`17`	`+sum =q + (((first !=null) ?first.val :0) + ((second !=null) ?second.val :0));`
	`18`	`+r =sum %10;`
	`19`	`+q =sum /10;`
	`20`	`+ListNodenewNode =newListNode(r);`
	`21`	`+if (head ==null) {`
	`22`	`+head =newNode;`
	`23`	`+ }else {`
	`24`	`+temp =head;`
	`25`	`+while(temp.next!=null){`
	`26`	`+temp=temp.next;`
	`27`	`+ }`
	`28`	`+temp.next =newNode;`
	`29`	`+newNode.next =null;`
	`30`	`+ }`
	`31`	`+if (first !=null) {`
	`32`	`+first =first.next;`
	`33`	`+ }`
	`34`	`+if (second !=null) {`
	`35`	`+second =second.next;`
	`36`	`+ }`
	`37`	`+ }`
	`38`	`+if(q>0){`
	`39`	`+ListNodenewNode =newListNode(q);`
	`40`	`+temp =head;`
	`41`	`+while(temp.next!=null){`
	`42`	`+temp=temp.next;`
	`43`	`+ }`
	`44`	`+temp.next =newNode;`
	`45`	`+newNode.next =null;`
	`46`	`+ }`
	`47`	`+returnhead;`
	`48`	`+ }`
	`49`	`+}`

Comments

(0)