摘要:        
# sort the array# loop from i = 0 # then left=i+1 right=len(nums)-1# try nums[i] - ( nums[left]+nums[right]) = 0 # class Solution(object): def thre...    阅读全文
posted @ 2015-11-19 23:19
hao.ma
阅读(214)
评论(0)
推荐(0)
        
            
        
        
摘要:        
class Solution(object): def longestCommonPrefix(self, strs): """ :type strs: List[str] :rtype: str """ if len(st...    阅读全文
posted @ 2015-11-19 20:17
hao.ma
阅读(182)
评论(0)
推荐(0)
        
 
                    
                
 浙公网安备 33010602011771号
浙公网安备 33010602011771号