LeetCode
DDMiao~
这个作者很懒,什么都没留下…
展开
-
LeetCode笔记(21-?)
21.Merge Two Sorted Lists# Definition for singly-linked list. # class ListNode(object): # def __init__(self, x): # self.val = x # self.next = Noneclass Solution(object): def mer原创 2017-09-28 17:41:21 · 444 阅读 · 0 评论 -
LeetCode笔记(11-20)
11.Container With Most Water#Container With Most Water#第一版 class Solution(object): def maxArea(self, height): maxA=0#最大容积 i=0#头坐标 j=len(height)-1#尾坐标 while i != j:原创 2017-09-15 13:25:41 · 278 阅读 · 0 评论 -
LeetCode笔记(1-10)?4,5,10
1.Two Sum#Given an array of integers, return indices of the two #numbers such that they add up to a specific target. #You may assume that each input would have exactly one #solution, and you may not us原创 2017-09-11 10:23:13 · 310 阅读 · 0 评论