Open lyChai1995 opened 4 years ago
ARTS 第十周(2019.11.11-2019.11.17) 移动零 Review Code Review主要Review什么? Tip 推荐几个不错的console调试技巧 Share: 你所不知道的 AI 进展 Algorithm 移动零 给定一个数组 nums,编写一个函数将所有 0 移动到数组的末尾,同时保持非零元素的相对顺序。 代码 /** * @param {number[]} nums * @return {void} Do not return anything, modify nums in-place instead. */ var moveZeroes = function(nums) { let k = 0; for (let i = 0; i < nums.length; i++) { if (nums[i] !== 0) { nums[k++] = nums[i]; } } for (let j = k; j < nums.length; j++) { nums[j] = 0; } return nums }; https://leetcode-cn.com/explore/interview/card/top-interview-questions-easy/1/array/28/ 理解:把0放在后面 相当于把非0放在前面 Review:Code Review主要Review什么? https://juejin.im/post/5dde87ce6fb9a071687e8304 Tip: 推荐几个不错的console调试技巧 https://juejin.im/post/5ddd373cf265da05d7582ce8 Share: 你所不知道的 AI 进展 http://www.ruanyifeng.com/blog/2019/10/artificial-intelligenence.html
移动零 给定一个数组 nums,编写一个函数将所有 0 移动到数组的末尾,同时保持非零元素的相对顺序。
/** * @param {number[]} nums * @return {void} Do not return anything, modify nums in-place instead. */ var moveZeroes = function(nums) { let k = 0; for (let i = 0; i < nums.length; i++) { if (nums[i] !== 0) { nums[k++] = nums[i]; } } for (let j = k; j < nums.length; j++) { nums[j] = 0; } return nums };
https://leetcode-cn.com/explore/interview/card/top-interview-questions-easy/1/array/28/ 理解:把0放在后面 相当于把非0放在前面
https://juejin.im/post/5dde87ce6fb9a071687e8304
https://juejin.im/post/5ddd373cf265da05d7582ce8
http://www.ruanyifeng.com/blog/2019/10/artificial-intelligenence.html