/
githubmirror
/
interviews
Обзор
Документация
Войти
/
githubmirror
/
interviews
Код
Запросы
0
Пакеты
0
Релизы
0
Аналитика
Безопасность
master
leetcode/two-pointers/MoveZeros.java
28 строк
805 B
Kevin Naughton Jr
finish renaming files and directories
27 мар 2018, 19:52
27 мар 2018, 19:52
ec6dfb5
Код
Авторство
О чём код?
// 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. public class MoveZeros { public void moveZeroes(int[] nums) { if(nums == null || nums.length == 0) { return; } int index = 0; for(int num : nums) { if(num != 0) { nums[index] = num; index++; } } while(index < nums.length) { nums[index] = 0; index++; } } }