Instantly share code, notes, and snippets.

🎯
Focusing

# mindthinkmindthink

🎯
Focusing
• Sort options
Created Mar 10, 2017
leetcode 88
View 88.py
 class Solution(object): def merge(self, nums1, m, nums2, n): """ :type nums1: List[int] :type m: int :type nums2: List[int] :type n: int :rtype: void Do not return anything, modify nums1 in-place instead. """ i = m - 1
Created Mar 10, 2017
leetcode 412:Fizz Buzz
View 412.py
 class Solution(object): def fizzBuzz(self, n): """ :type n: int :rtype: List[str] """ l = [] for i in range(1, n + 1): if i % 3 == 0 and i % 5 == 0: l.append("FizzBuzz")
Created Mar 10, 2017
leetcode 41:First Missing Positive
View 41.py
 class Solution(object): def firstMissingPositive(self, nums): """ :type nums: List[int] :rtype: int """ max_num = len(nums) +1 nums_set = set(nums) for i in range(1, max_num): if i not in nums_set:
Last active Feb 25, 2017

View palibdrome.c
 book IsPalindrome(const char *s,int n) { //非法输入 if(s == NULL || n < 1) { return false; } const char* front,*back; //初始化头指针和尾指针
You can’t perform that action at this time.