LeetCode-27-Remove Element(C语言实现)
2018-01-02 00:47
816 查看
int removeElement(int* nums, int numsSize, int val) {
int i, j, flag = 0;
for(i = 0; i < numsSize; ++i){
if(nums[i] == val){
++flag;
for(j = i + 1; nums[j] != val && j < numsSize; ++j){
nums[j - flag] = nums[j];
}
}
}
return numsSize - flag;
}
int i, j, flag = 0;
for(i = 0; i < numsSize; ++i){
if(nums[i] == val){
++flag;
for(j = i + 1; nums[j] != val && j < numsSize; ++j){
nums[j - flag] = nums[j];
}
}
}
return numsSize - flag;
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- [C语言][LeetCode][27]Remove Element
- [leetcode-27]Remove Element(C语言)
- LeetCode 27: Remove Element
- LeetCode-56-Merge Intervals(C语言实现)
- [LeetCode]27. Remove Element
- leetcode27 Remove Element
- leetcode 之Maximum Depth of Binary Tree 用 C语言实现
- Leetcode 27. Remove Element
- [leetcode]Same Tree(判断两个二叉树是否相等 C语言实现)
- [Leetcode] 27 - Remove Element
- LeetCode-748-Largest Number At Least Twice of Others(C语言实现)
- Leetcode 27 Remove Element
- 5---LeetCode【tag: Array】【Remove Element】|C语言|总结
- LeetCode-Array-27 Remove Element
- LeetCode-27-Remove Element(消除数组中给定的元素)
- leetcode 27:Remove Element
- LeetCode --- 27. Remove Element
- LeetCode-7-Reverse Integer(C语言实现)
- Leetcode 27 Remove Element
- [Leetcode]27. Remove Element