LeetCode 27. 移除元素

思路

题目地址：https://leetcode-cn.com/problems/remove-element/submissions/
思路：把要去掉的元素移动到数组的最后即可。好吧，我自己写的代码很长，官方题解的双指针好像代码很短，而且思路很清晰

代码

public class Solution {

    public void swap(int[] nums, int a, int b) {
        int temp = nums[a];
        nums[a] = nums[b];
        nums[b] = temp;
    }
    public int removeElement(int[] nums, int val) {
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] == val) {
                for (int j = i + 1; j < nums.length; j++) {
                    if (nums[j] != val) {
                        swap(nums, i, j);
                        break;
                    }
                }
            }
        }
        int count = 0;
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] == val) {
                break;
            }
            count++;
        }
        return count;
    }
}