p283

发表于 | 分类于 |

LeetCode P283 Move Zeroes 题解

1.题目：

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置于数组的末尾，一次遍历不使用多余的空间

2.解题思路:

采取将所有非零值往前移动的思路，设置一个节点并慢慢推动节点，遍历完数组之后将节点之后的数全部设置为0

3.代码

[title] [] [url] [link text]
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
 
package leetcode;

import java.awt.List;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

/**
 * 
 * @author ZhangMengRou
 *
 */
public class p283 {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		String a = in.nextLine();

		int[] nn1 = new int[(a.length() + 1) / 2];
		String[] n1 = a.split(" ");

		for (int i = 0; i < (a.length() + 1) / 2; i++) {
			nn1[i] = Integer.parseInt(n1[i]);
			// System.out.println(nn1[i]);
		}

		// 完成数据的输入并进行处理
		moveZeroes(nn1);
		for (int i = 0; i < nn1.length; i++) {
			System.out.print(nn1[i] + " ");
		}

	}

	public static void moveZeroes(int[] nums) {
		int sit = 0;
		for (int j = 0; j < nums.length; j++) {
			if (nums[j] != 0) {
				nums[sit] = nums[j];
				sit++;
			}
		}
		// System.out.println(sit+"  "+nums.length);
		for (int j = sit; j < nums.length; j++) {

			nums[j] = 0;
		}
	}

}


4.一些总结：~