Lemon Sun

Pascal’s Triangle： Given numRows, generate the first numRows of Pascal’s triangle. For example, given numRows = 5, Return [ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,

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]. Note: Could you optimize your algorithm to use onl

217. Contains Duplicate Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return

219. Contains Duplicate II Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference between i a

注：string转int：atoi(str.c_str())int转string：to_string(num)int，long，long long取值范围：unsigned int 0～4294967295 int 2147483648～2147483647-unsigned long 0～4294967295long 2147483648～2147483647