Nitpicking的专栏

（数组）leetcode 119：Pascal's Triangle II Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3, Return [1,3,3,1].

刷题笔记 leetcode 118：Pascal's Triangle (tag：数组)

Given a sorted integer array without duplicates, return the summary of its ranges. For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"]. 题目意思： 给出一个有序无重复整数数组，返回数组的有序片段。     即将数组中连续的数字

（数组）leetcode 283：Move Zeroes

（数组）leetcode 88：Merge Sorted Array