摘要: Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3,Return [1,3,3,1]. Note:Could you optimize your algorithm to us 阅读全文
posted @ 2018-03-22 21:58 还是说得清点吧 阅读(91) 评论(0) 推荐(0)
摘要: Given an array of integers nums, write a method that returns the "pivot" index of this array. We define the pivot index as the index where the sum of 阅读全文
posted @ 2018-03-22 20:48 还是说得清点吧 阅读(182) 评论(0) 推荐(0)