Commitb2188e0

authored

Update Merge Two Sorted Lists.java

1 parent9bc4661 commitb2188e0Copy full SHA for b2188e0

File tree

+27

-15

lines changed

+27

-15

lines changed

Lines changed: 27 additions & 15 deletions

Original file line number	Diff line number	Diff line change
`@@ -10,26 +10,38 @@`
`10`	`10`	`*/`
`11`	`11`	`classSolution {`
`12`	`12`	`publicListNodemergeTwoLists(ListNodelist1,ListNodelist2) {`
`13`		`-ListNodedummy =newListNode(-1);`
`14`		`-ListNodecurr =dummy;`
`15`		`-while (list1 !=null \|\|list2 !=null) {`
`16`		`-if (list1 !=null &&list2 !=null) {`
`17`		`-if (list1.val >list2.val) {`
`18`		`-curr.next =newListNode(list2.val);`
`19`		`-list2=list2.next;`
`20`		`-}else {`
`21`		`-curr.next =newListNode(list1.val);`
`22`		`-list1 =list1.next;`
	`13`	`+if (list1 ==null \|\|list2 ==null) {`
	`14`	`+returnlist1 ==null ?list2 :list1;`
	`15`	`+}`
	`16`	`+ListNodeprev=null;`
	`17`	`+ListNodehead =null;`
	`18`	`+while (list1 !=null &&list2 !=null) {`
	`19`	`+if (list1.val <=list2.val) {`
	`20`	`+prev =list1;`
	`21`	`+if (head ==null) {`
	`22`	`+head =list1;`
`23`	`23`	`}`
`24`		`- }elseif (list1 !=null &&list2 ==null) {`
`25`		`-curr.next =newListNode(list1.val);`
`26`	`24`	`list1 =list1.next;`
`27`	`25`	`}else {`
`28`		`-curr.next =newListNode(list2.val);`
	`26`	`+ListNodenode =list2;`
`29`	`27`	`list2 =list2.next;`
	`28`	`+if (prev ==null) {`
	`29`	`+node.next =list1;`
	`30`	`+prev =node;`
	`31`	`+head =prev;`
	`32`	`+ }else {`
	`33`	`+prev.next =node;`
	`34`	`+node.next =list1;`
	`35`	`+prev =node;`
	`36`	`+ }`
`30`	`37`	`}`
`31`		`-curr =curr.next;`
`32`	`38`	`}`
`33`		`-returndummy.next;`
	`39`	`+if (list2 !=null) {`
	`40`	`+prev.next =list2;`
	`41`	`+ }`
	`42`	`+if (list1 !=null) {`
	`43`	`+prev.next =list1;`
	`44`	`+ }`
	`45`	`+returnhead;`
`34`	`46`	`}`
`35`	`47`	`}`

Comments

(0)