2019年1月30日
19.1.30 [LeetCode 29] Divide Two Integers
摘要： Given two integers dividend and divisor, divide two integers without using multiplication, division and mod operator. Return the quotient after dividi 阅读全文
posted @ 2019-01-30 17:02 TobicYAL 阅读(143) 评论(0) 推荐(0)
19.1.30 [LeetCode 28] Implement strStr()
摘要： Implement strStr(). Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. Example 1: Example 2: Cla 阅读全文
posted @ 2019-01-30 11:32 TobicYAL 阅读(128) 评论(0) 推荐(0)
19.1.30 [LeetCode 27] Remove Element
摘要： Given an array nums and a value val, remove all instances of that value in-placeand return the new length. Do not allocate extra space for another arr 阅读全文
posted @ 2019-01-30 10:48 TobicYAL 阅读(145) 评论(0) 推荐(0)
19.1.30 [LeetCode 26] Remove Duplicates from Sorted Array
摘要： Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length. Do not allocate extra spa 阅读全文
posted @ 2019-01-30 10:35 TobicYAL 阅读(155) 评论(0) 推荐(0)
19.1.30 [LeetCode 25] Reverse Nodes in k-Group
摘要： Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. k is a positive integer and is less than or equal to 阅读全文
posted @ 2019-01-30 10:16 TobicYAL 阅读(134) 评论(0) 推荐(0)
19.1.30 [LeetCode 24] Swap Nodes in Pairs
摘要： Given a linked list, swap every two adjacent nodes and return its head. Example: Note: Your algorithm should use only constant extra space. You may no 阅读全文
posted @ 2019-01-30 09:31 TobicYAL 阅读(155) 评论(0) 推荐(0)