LeetCode oj 283. Move Zeroes (选择排序)
来源:互联网 发布:淘宝网的运营模式是() 编辑:程序博客网 时间:2024/05/21 15:46
283. Move Zeroes
- Total Accepted: 122129
- Total Submissions: 262841
- Difficulty: Easy
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'都移到最后面,并且不能copy数组和必须最少的操作数
想一想选择排序就有思路了,选取第一个不是0的元素,把他放到第一位,再选取第二个不是0的元素,放到第二位,循环一遍就可以了
public class Solution { public void moveZeroes(int[] nums) { int len = nums.length; int index = 0; for(int i=0;i<len;i++){ if(nums[i] != 0){ int temp = nums[index]; nums[index] = nums[i]; nums[i] = temp; index++; } } }}
0 0
- LeetCode oj 283. Move Zeroes (选择排序)
- <LeetCode OJ> 283. Move Zeroes
- LeetCode OJ-283. Move Zeroes
- 【LeetCode】283. Move Zeroes
- Leetcode 283. Move Zeroes
- LeetCode #283. Move Zeroes
- 283. Move Zeroes LeetCode
- LeetCode 283. Move Zeroes
- LeetCode 283. Move Zeroes
- LeetCode 283. Move Zeroes
- 【LeetCode】283. Move Zeroes
- leetcode 283. Move Zeroes
- leetcode 283. Move Zeroes
- LeetCode 283. Move Zeroes
- leetcode 283. Move Zeroes
- #leetcode#283. Move Zeroes
- LeetCode *** 283. Move Zeroes
- LeetCode 283. Move Zeroes
- ARP协议解析
- 手势识别(一)--手势基本概念和ChaLearn Gesture Challenge
- shell脚本——正则表达式
- sessionStorage 、localStorage 和 cookie 之间的区别
- Java-IO之RandomAccessFile
- LeetCode oj 283. Move Zeroes (选择排序)
- 41. First Missing Positive
- Partial Functions(偏函数)
- 按钮的callback
- XML学习笔记(1)-DTD
- 【周赛】第一周周赛——欢迎16级的新同学题解(题目出自codeforces 318A,546A,431C,665E,HDU 4104)
- (Java)LeetCode-58. Length of Last Word
- nyist 1272 表达式求值 (河南省第九届省赛) 中缀转后缀
- atoi和stoi