LeetCode 283
Move Zeros
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 Solution {
     public void moveZeroes(int[] nums) {
         int a = 0;
         int b = 0;
         for(int i = 0 ; i < nums.length ; i++){
             if( nums[i] == 0 ){
                 a++;
             }else{
                 nums[b] = nums[a];
                 a++;
                 b++;
             }
         }
         while(b < nums.length){
             nums[b]=0;
             b++;
         }
     }
 }
LeetCode 283的更多相关文章
- 前端与算法 leetcode 283. 移动零
		
目录 # 前端与算法 leetcode 283. 移动零 题目描述 概要 提示 解析 解法一:暴力法 解法二:双指针法 算法 传入[0,1,0,3,12]的运行结果 执行结果 GitHub仓库 # 前 ...
 - LeetCode 283. Move Zeroes (移动零)
		
Given an array nums, write a function to move all 0's to the end of it while maintaining the relativ ...
 - leetcode 283. Move Zeroes -easy
		
题目链接:https://leetcode.com/problems/move-zeroes/ 题目内容: Given an array nums, write a function to move ...
 - LN : leetcode 283 Move Zeroes
		
lc 283 Move Zeroes 283 Move Zeroes Given an array nums, write a function to move all 0's to the end ...
 - 2017-3-9 leetcode 283 287 289
		
今天操作系统课,没能安心睡懒觉23333,妹抖龙更新,可惜感觉水分不少....怀念追RE0的感觉 =================================================== ...
 - [LeetCode] 283. Move Zeroes 移动零
		
Given an array nums, write a function to move all 0's to the end of it while maintaining the relativ ...
 - Java实现 LeetCode 283 移动零
		
283. 移动零 给定一个数组 nums,编写一个函数将所有 0 移动到数组的末尾,同时保持非零元素的相对顺序. 示例: 输入: [0,1,0,3,12] 输出: [1,3,12,0,0] 说明: 必 ...
 - LeetCode 283 Move Zeros
		
Problem: Given an array nums, write a function to move all 0's to the end of it while maintaining th ...
 - Leetcode 283 Move Zeroes 字符串
		
class Solution { public: void moveZeroes(vector<int>& nums) { ; ; i< nums.size(); ++i){ ...
 
随机推荐
- homework-02,第二次作业——寻找矩阵最大子序列和
			
经过漫漫漫~~~~~~~~~~~~~~长的编译和调试,第二次作业终于告一段落了 先放出源码,思路后面慢慢道来 #include<stdio.h> #include<stdlib.h& ...
 - Shell字符串使用十进制转换
			
其实不知道该起什么题目. 先说下需求,线上的log是按照五分钟为粒度切分的,即每五分钟产生一个文件,19:04的log写入到 1900结尾的log文件中,19:05写入到1905结尾的log文件中. ...
 - Spring + JdbcTemplate + JdbcDaoSupport examples
			
In Spring JDBC development, you can use JdbcTemplate and JdbcDaoSupport classes to simplify the over ...
 - poj 1543 Perfect Cubes(注意剪枝)
			
Perfect Cubes Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 14901 Accepted: 7804 De ...
 - [iOS UI进阶 - 2.0] 彩票Demo v1.0
			
A.需求 1.模仿“网易彩票”做出有5个导航页面和相应功能的Demo 2.v1.0 版本搭建基本框架 code source:https://github.com/hellovoidworld/H ...
 - oracle 11g 之 result cache
			
oracle 11g 之 result cache 今天是2013-10-12,打算最近时间研究一下shared pool的相关原理以及awr报告分析.今天学习一下在oracle 11g shared ...
 - sql 调用函数的方法
			
USE [ChangHong_612]GO/****** Object: StoredProcedure [dbo].[st_MES_RptInspectWeight] Script Date: 09 ...
 - 嗯,记录一些eclipse的快捷键
			
alt+/:自动补全 ctrl+/:注释 // 再按一下取消注释 ctrl+shift+\:区块注释 /* */ ctrl+shift+\:取消区块注释 ctrl+shift+f:格式化代码 ctrl ...
 - Codeforces Round #277 (Div. 2) D. Valid Sets 暴力
			
D. Valid Sets Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/486/problem ...
 - Codeforces Gym 100513I I. Sale in GameStore 暴力
			
I. Sale in GameStore Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/gym/100513/p ...