leetCode
做好自己1
这个作者很懒,什么都没留下…
展开
-
LeetCode 旋转数组
class Solution { func rotate(_ nums: inout [Int], _ k: Int) { if (nums.count == 0 || nums.count == 1 || k % nums.count == 0) { return } let step = k % nums.cou...原创 2019-03-29 15:17:42 · 173 阅读 · 0 评论 -
LeetCode 从排序数组中删除重复项
近期开始刷题,大家可以关注下,从排序数组中删除重复项,大家有好的算法可以分享哦class Solution { func removeDuplicates(_ nums: inout [Int]) -> Int { if (nums.count == 0 || nums.count == 1) { return nums.count ...原创 2019-03-27 15:25:05 · 116 阅读 · 0 评论 -
leetcode存在重复
class Solution { func containsDuplicate(_ nums: [Int]) -> Bool { let set = Set(nums) return set.count != nums.count }}原创 2019-04-01 15:58:50 · 205 阅读 · 0 评论 -
leetcode 移动零
class Solution { func moveZeroes(_ nums: inout [Int]) { if (nums.count == 0 || nums.count == 1) { return } var offet = 0 var change = 0 while o...原创 2019-04-03 14:25:10 · 162 阅读 · 0 评论