zoukankan      html  css  js  c++  java
  • LeetCode_27. Remove Element

    27. Remove Element

    Easy

    Given an array nums and a value val, remove all instances of that value in-place and return the new length.

    Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.

    The order of elements can be changed. It doesn't matter what you leave beyond the new length.

    Example 1:

    Given nums = [3,2,2,3], val = 3,
    
    Your function should return length = 2, with the first two elements of nums being 2.
    
    It doesn't matter what you leave beyond the returned length.
    

    Example 2:

    Given nums = [0,1,2,2,3,0,4,2], val = 2,
    
    Your function should return length = 5, with the first five elements of nums containing 0, 1, 3, 0, and 4.
    
    Note that the order of those five elements can be arbitrary.
    
    It doesn't matter what values are set beyond the returned length.

    Clarification:

    Confused why the returned value is an integer but your answer is an array?

    Note that the input array is passed in by reference, which means modification to the input array will be known to the caller as well.

    Internally you can think of this:

    // nums is passed in by reference. (i.e., without making a copy)
    int len = removeElement(nums, val);
    
    // any modification to nums in your function would be known by the caller.
    // using the length returned by your function, it prints the first len elements.
    for (int i = 0; i < len; i++) {
        print(nums[i]);
    }
    package leetcode.easy;
    
    public class RemoveElement {
    	@org.junit.Test
    	public void test() {
    		int[] nums11 = { 3, 2, 2, 3 };
    		int[] nums12 = { 0, 1, 2, 2, 3, 0, 4, 2 };
    		int[] nums21 = { 3, 2, 2, 3 };
    		int[] nums22 = { 0, 1, 2, 2, 3, 0, 4, 2 };
    		int val1 = 3;
    		int val2 = 2;
    		System.out.println(removeElement1(nums11, val1));
    		System.out.println(removeElement1(nums12, val2));
    		System.out.println(removeElement2(nums21, val1));
    		System.out.println(removeElement2(nums22, val2));
    	}
    
    	public int removeElement1(int[] nums, int val) {
    		int i = 0;
    		for (int j = 0; j < nums.length; j++) {
    			if (nums[j] != val) {
    				nums[i] = nums[j];
    				i++;
    			}
    		}
    		return i;
    	}
    
    	public int removeElement2(int[] nums, int val) {
    		int i = 0;
    		int n = nums.length;
    		while (i < n) {
    			if (nums[i] == val) {
    				nums[i] = nums[n - 1];
    				// reduce array size by one
    				n--;
    			} else {
    				i++;
    			}
    		}
    		return n;
    	}
    }
    
  • 相关阅读:
    Linux服务器免密登录设置
    Docker 批量停止、删除容器和镜像
    python破解wifi密码
    python调用paramiko模块连接服务器
    Docker搭建redis-cluster集群三主三备
    Centos7.7搭建Prometheus2.0+Grafana监控Docker容器
    Centos7.7部署fastdfs分布式文件系统
    拉取git代码仓库项目到本地
    Seafile对接Amazon S3存储后端
    Centos7.x部署SeaFile私有网盘
  • 原文地址:https://www.cnblogs.com/denggelin/p/11550731.html
Copyright © 2011-2022 走看看