2019年10月13日
[LC] 53. Maximum Subarray
摘要： Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Example: Inpu 阅读全文
posted @ 2019-10-13 23:13 xuan_abc 阅读(125) 评论(0) 推荐(0)
[LC] 47. Permutations II
摘要： Given a collection of numbers that might contain duplicates, return all possible unique permutations. Example: Input: [1,1,2] Output: [ [1,1,2], [1,2, 阅读全文
posted @ 2019-10-13 04:36 xuan_abc 阅读(115) 评论(0) 推荐(0)