2017年9月21日
LeetCode 485. Max Consecutive Ones （最长连续1）
摘要： Given a binary array, find the maximum number of consecutive 1s in this array. Example 1: Note: The input array will only contain 0 and 1. The length 阅读全文
posted @ 2017-09-21 01:16 Jimmy_Cheng 阅读(327) 评论(0) 推荐(0)
LeetCode 448. Find All Numbers Disappeared in an Array （在数组中找到没有出现的数字）
摘要： Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once. Find all the elements of [1, n] 阅读全文
posted @ 2017-09-21 00:57 Jimmy_Cheng 阅读(207) 评论(0) 推荐(0)