2019年3月9日

LeetCode_80

摘要: 题目描述: Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length. Do not allocate 阅读全文

posted @ 2019-03-09 17:16 harchar 阅读(142) 评论(0) 推荐(0)

LeetCode_27

摘要: 题目描述: Given an array nums and a value val, remove all instances of that value in-placeand return the new length. Do not allocate extra space for anoth 阅读全文

posted @ 2019-03-09 17:11 harchar 阅读(76) 评论(0) 推荐(0)

LeetCode_26

摘要: 题目描述: Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length. Do not allocate ext 阅读全文

posted @ 2019-03-09 17:09 harchar 阅读(98) 评论(0) 推荐(0)

LeetCode_283

摘要: 题目描述: Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements. 实现思路: 定义区间 阅读全文

posted @ 2019-03-09 17:03 harchar 阅读(88) 评论(0) 推荐(0)

导航