Skip to content

These code cannot be judged successfully #26

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 2 commits into from
Closed

These code cannot be judged successfully #26

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
a87b050
021 fix: if one of the given lists is null
Apr 25, 2019
f1c5a62
021 fix: if one of the given lists is null
Apr 25, 2019
File filter

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 5 additions & 0 deletions note/021/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -31,6 +31,11 @@ class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode head = new ListNode(0);
ListNode temp = head;
if (l1 == null) {
return l2;
} else if (l2 == null) {
return l1;
}
while (l1 != null && l2 != null) {
if (l1.val < l2.val) {
temp.next = l1;
Expand Down
7 changes: 6 additions & 1 deletion src/com/blankj/easy/_021/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -14,6 +14,11 @@ public class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode head = new ListNode(0);
ListNode temp = head;
if (l1 == null) {
return l2;
} else if (l2 == null) {
return l1;
}
while (l1 != null && l2 != null) {
if (l1.val < l2.val) {
temp.next = l1;
Expand All @@ -36,4 +41,4 @@ public static void main(String[] args) {
ListNode.print(listNode1);
ListNode.print(solution.mergeTwoLists(listNode0, listNode1));
}
}
}