283. Move Zeroes

最新推荐文章于 2021-01-10 04:51:27 发布

最大的敌人是自己

最新推荐文章于 2021-01-10 04:51:27 发布

阅读量247

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/yyg_wtf/article/details/51193413

版权

leetcode 专栏收录该内容

28 篇文章 0 订阅

订阅专栏

问题描述：
Given an array nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], after calling your function, nums should be [1, 3, 12, 0, 0].Note:You must do this in-place without making a copy of the array.Minimize the total number of operations.

我的解决思路：像插入排序一样，将元素一个个插入到数组中，记住要判断插入的元素是否为0

下面附上代码：

public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
    ListNode fakeHead = new ListNode(0);
    ListNode current = fakeHead;
    while (l1 != null && l2 != null) {
        if (l1.val <= l2.val) {
            current.next = l1;
            l1 = l1.next;
        } else {
            current.next = l2;
            l2 = l2.next;
        }
        current = current.next;
    }
    if (l1 == null) current.next = l2;
    if (l2 == null) current.next = l1;
    return fakeHead.next;
}