Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenDocCN
awesome-algorithm
提交
b1fb9f7a
A
awesome-algorithm
项目概览
OpenDocCN
/
awesome-algorithm
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
A
awesome-algorithm
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
前往新版Gitcode,体验更适合开发者的 AI 搜索 >>
未验证
提交
b1fb9f7a
编写于
6月 08, 2019
作者:
K
Keqi Huang
提交者:
GitHub
6月 08, 2019
浏览文件
操作
浏览文件
下载
差异文件
Merge pull request #267 from royIdoodle/master
0027 Solution Added
上级
20683a21
2c680d9c
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
81 addition
and
0 deletion
+81
-0
docs/Leetcode_Solutions/JavaScript/0027._Remove_Element.md
docs/Leetcode_Solutions/JavaScript/0027._Remove_Element.md
+81
-0
未找到文件。
docs/Leetcode_Solutions/JavaScript/0027._Remove_Element.md
0 → 100644
浏览文件 @
b1fb9f7a
# 027. Remove Element
**<font color=red>难度: Easy</font>**
## 刷题内容
> 原题连接
*
https://leetcode.com/problems/remove-element
> 内容描述
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]);
}
## 解题方案
> 思路 1
******- 时间复杂度: O(N)******
- 空间复杂度: O(1)
****
**
保留两个指针 i 和 j,其中 i 是慢指针,j 是快指针。当 nums[j] 与给定的值相等时,递增 j 以跳过该元素。只要 nums[j] !== val,我们就复制 nums[j] 到 nums[i] 并同时递增两个索引。重复这一过程,直到 j 到达数组的末尾,该数组的新长度为 i。
代码:
```
javascript
/**
* @param {number[]} nums
* @param {number} val
* @return {number}
*/
var
removeElement
=
function
(
nums
,
val
)
{
let
j
=
0
;
for
(
let
i
=
0
,
len
=
nums
.
length
;
i
<
len
;
i
++
){
if
(
nums
[
i
]
!==
val
){
nums
[
j
]
=
nums
[
i
];
j
++
}
}
return
j
;
};
```
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录