zoukankan      html  css  js  c++  java
  • leetcode 27 Remove Element

    
    Remove Element Total Accepted: 60351 Total Submissions: 187833 My Submissions
                         

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

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

    Show Tags


    c++ 解决方案:

    class Solution {
    public:
        int removeElement(vector<int>& nums, int val) {
            int n = nums.size();
            int i = 0;
            while( i < n ) { 
                if( nums[i] == val ) {
                    swap(nums[i], nums[n-1]);
                    n--;
                } else {
                    i++;
                }
            }
            return n;
        }
    };
    

    int removeElement(vector<int>& nums, int val)
    {
        vector<int>::iterator  itr = nums.begin();
        while (itr != nums.end())
        {
            if (*itr == val)
                itr = nums.erase(itr);
            else
                ++itr;
        }
        return nums.size();
    }
    

    int removeElement(int A[], int n, int elem) {
        int begin=0;
        for(int i=0;i<n;i++) if(A[i]!=elem) A[begin++]=A[i];
        return begin;
    }


    python解决方案:
    class Solution:
    # @param    A       a list of integers
    # @param    elem    an integer, value need to be removed
    # @return an integer
    def removeElement(self, A, elem):
        i = 0
        for j in range(len(A)):
            if A[j] != elem:
                A[i] = A[j]
                i += 1
        return i
    

    史上最简洁的解决方案:
    def removeElement(self, nums, val):
            nums[:] = [x for x in nums if x!=val]
            return len(nums)



  • 相关阅读:
    同步gitlab与github
    配置hosts快速访问GitHub
    Linux下Julia安装
    LATEX图片位置
    IPOPT安装
    sqlplus传入shell变量
    users表空间满导致应用无法连接
    坏块修复 ORA-00701
    Oracle中INITRANS和MAXTRANS参数(转)
    DBMS_ROWID包的使用
  • 原文地址:https://www.cnblogs.com/wangyaning/p/7853960.html
Copyright © 2011-2022 走看看