caicai617的博客

冒泡 [code=python] def Bubble(array):     n = len(array)     for i in range(n-1):         for j in range(n-1,i,-1):             if array[j]                 array[j], array[j-1] = array[j-1], arr

据说是一道挺重要的题，一定背下来嗯…… /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { pub

Leetcode 263. Ugly Number class Solution(object): def isUgly(self, num): """ :type num: int :rtype: bool """ if num <= 0: return False