摘要:        
原题链接在这里:https://leetcode.com/problems/max-consecutive-ones-iii/ 题目: Given an array A of 0s and 1s, we may change up to K values from 0 to 1. Return th    阅读全文
        
            posted @ 2019-08-23 11:51
Dylan_Java_NYC
阅读(383)
评论(0)
推荐(0)
        
        
            
        
        
摘要:        
原题链接在这里: 题目: In a row of trees, the i-th tree produces fruit with type tree[i]. You start at any tree of your choice, then repeatedly perform the foll    阅读全文
        
            posted @ 2019-08-23 01:14
Dylan_Java_NYC
阅读(261)
评论(0)
推荐(0)
        
        
            
        
        
摘要:        
原题链接在这里:https://leetcode.com/problems/binary-subarrays-with-sum/ 题目: In an array A of 0s and 1s, how many non-empty subarrays have sum S? Example 1: N    阅读全文
        
            posted @ 2019-08-23 00:43
Dylan_Java_NYC
阅读(370)
评论(0)
推荐(0)
        
        
 
                    
                     
                    
                 
                    
                 
         浙公网安备 33010602011771号
浙公网安备 33010602011771号