leetcode -Remove Element
2016-05-21 23:19
316 查看
27. Remove Element
Given an array and a value, 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 in place with constant memory. The
order of elements can be changed. It doesn't matter what you leave beyond the new length.
Example:
Given input array nums = [3,2,2,3], val = 3
Your function should return length = 2, with the first two elements of nums being 2.
解析:给一个队列和一个值value;要求去除队列中和value相等的元素。返回去除某值后的元素个数n。且不与value相等的元素要位于队列的前n位。
代码:
Given an array and a value, 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 in place with constant memory. The
order of elements can be changed. It doesn't matter what you leave beyond the new length.
Example:
Given input array nums = [3,2,2,3], val = 3
Your function should return length = 2, with the first two elements of nums being 2.
解析:给一个队列和一个值value;要求去除队列中和value相等的元素。返回去除某值后的元素个数n。且不与value相等的元素要位于队列的前n位。
代码:
class Solution(object): def removeElement(self, nums, val): """ :type nums: List[int] :type val: int :rtype: int """ c=0 for i in range(len(nums)): if nums[i]==val: continue else: nums[c]=nums[i] c+=1 return c
相关文章推荐
- 深入Java集合类
- 关于java中jsp和servlet传值的问题
- 杭电OJ 1008 应该全面考虑问题
- OpenCV 开发环境环境搭建(win10+vs2015+opencv 3.0)
- phpstorm 的一些常用设置
- Oscdimg 命令行选项
- Java 利用异常 求和
- hdu2519:新生晚会
- Android——View事件分发机制
- 菜鸟上路 杭电OJ 1007 求平面上两点之间最短距离--分而治之以及关键点的考虑
- 11G RAC重建ASM实例的SPFILE
- Qtcreator 调试cmake
- many-to-many
- 洛谷比赛有感
- 快速掌握Makefile
- [BZOJ1004][HNOI2008]Cards(置换群+背包+乘法逆元)
- 浅谈JVM的实现与垃圾回收机制
- 堆排序——java
- google earth 中的飞行模拟器的键盘控制
- 3176: [Coci 2012]Sort 树状数组