283. Move Zeroes
来源:互联网 发布:曾是编程员的音乐人 编辑:程序博客网 时间:2024/06/03 07:07
/*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.两指针问题*/#include <stdio.h>void moveZeroes(int* nums, int numsSize) { int *start=nums,*fast=nums; while(fast < nums+numsSize) { while(fast < nums+numsSize && *fast == 0) fast++; if(fast < nums+numsSize) *start++=*fast++; } while(start < nums+numsSize) *start++=0;}int main(){ int nums[]={0,0}; int numsSize=sizeof(nums)/sizeof(int); moveZeroes(nums,numsSize); int i=0; for(;i<numsSize;i++) printf("%d\n",nums[i]); return 0;}
阅读全文
0 0
- 283.Move Zeroes
- 283. Move Zeroes
- 283. Move Zeroes
- 283. Move Zeroes
- 283. Move Zeroes
- 【LeetCode】283. Move Zeroes
- 283. Move Zeroes
- 283. Move Zeroes
- Leetcode 283. Move Zeroes
- 283. Move Zeroes
- LeetCode #283. Move Zeroes
- 283. Move Zeroes LeetCode
- 283. Move Zeroes
- LeetCode 283. Move Zeroes
- LeetCode 283. Move Zeroes
- 283. Move Zeroes
- 283. Move Zeroes
- LeetCode 283. Move Zeroes
- Bigtable: A Distributed Storage System for Structured Data : part4 Building Blocks
- 数据结构题目总结
- linux 常用命令
- 基于Swift 的Apple Watch 开发教程介绍
- 铺地板状压DP求方案数
- 283. Move Zeroes
- 二步实现 远程连接 阿里云SqlServer 2012 数据库服务器
- Linux 查看系统硬件信息(实例详解)
- Spring中AOP注解实现
- ACDSee 2018 Pro下载 v11.0.785免费版
- Linux学习(五)软件包和文件系统管理
- 双飞翼模型---聊天框
- Spring+Quartz框架实现定时任务(集群,分布式)
- sed用法小记