LeetCode
文章平均质量分 78
Destinesia12
[DL,ML,CV,DIP][MS.Dept.Automation,THU,Beijing,PRC][E-mail:jzsherlock@163.com]
展开
-
LeetCode小白菜笔记[2]:Reverse Integer
LeetCode小白菜笔记[2]:Reverse Integer原创 2017-12-09 23:18:42 · 333 阅读 · 0 评论 -
LeetCode小白菜笔记[14]:Length of Last Word
LeetCode小白菜笔记[14]:Length of Last Word58. Length of Last Word [easy]题目如下:Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word i...原创 2018-02-09 17:36:03 · 304 阅读 · 0 评论 -
LeetCode小白菜笔记[20]:Remove Duplicates from Sorted List
LeetCode小白菜笔记[20]:Remove Duplicates from Sorted List83. Remove Duplicates from Sorted List [easy]Given a sorted linked list, delete all duplicates such that each element appear only once.For e...原创 2018-02-11 23:04:36 · 206 阅读 · 0 评论 -
LeetCode小白菜笔记[21]:Merge Sorted Array
LeetCode小白菜笔记[21]:Merge Sorted Array88. Merge Sorted Array [easy]Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note: You may assume that nums1 has ...原创 2018-02-13 11:59:49 · 195 阅读 · 0 评论 -
LeetCode小白菜笔记[22]:Same Tree
LeetCode小白菜笔记[22]:Same Tree100. Same Tree [easy]Given two binary trees, write a function to check if they are the same or not.Two binary trees are considered the same if they are structurally ...原创 2018-02-13 20:07:32 · 228 阅读 · 0 评论 -
LeetCode小白菜笔记[23]:Symmetric Tree
LeetCode小白菜笔记[23]:Symmetric Tree101. Symmetric Tree [easy]Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree [1,2,2,3,4...原创 2018-02-13 22:13:49 · 236 阅读 · 0 评论 -
LeetCode小白菜笔记[19]:Maximum Depth of Binary Tree
LeetCode小白菜笔记[19]:Maximum Depth of Binary Tree104. Maximum Depth of Binary Tree [easy]由于编号失误,居然漏了一个19,在这里补充上。题目:Given a binary tree, find its maximum depth.The maximum depth is the number ...原创 2018-02-13 23:08:41 · 232 阅读 · 0 评论 -
LeetCode小白菜笔记[18]:Climbing Stairs
LeetCode小白菜笔记[18]:Climbing Stairs70. Climbing Stairs [easy]You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct...原创 2018-02-11 22:03:19 · 257 阅读 · 0 评论 -
LeetCode基本记录【1】// BASIC NOTES AND CODES OF LEETCODE [ 1 ]
LeetCode基本记录【1】鉴于时间紧迫,只能简单记录,并且每次十道题为一篇,仅记录代码和必要的说明。后续再整理。Leetcode 1 contains the following problems and their solutionsAdd Two NumbersLongest Substring Without Repeating CharactersLongest Pa...原创 2018-03-13 23:56:06 · 361 阅读 · 0 评论 -
LeetCode基本记录【3】// BASIC NOTES AND CODES OF LEETCODE [ 3 ]
LeetCode基本记录【3】43. Multiply StringsGiven two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2.Note:The length of both num1 and num2 is < 110...原创 2018-03-30 01:43:28 · 238 阅读 · 0 评论 -
LeetCode基本记录【6】// BASIC NOTES AND CODES OF LEETCODE [ 6 ]
# LeetCode基本记录【6】93. Restore IP AddressesGiven a string containing only digits, restore it by returning all possible valid IP address combinations.For example: Given “25525511135”,return [“...原创 2018-04-07 17:17:50 · 275 阅读 · 0 评论 -
LeetCode基本记录【2】// BASIC NOTES AND CODES OF LEETCODE [ 2 ]
LeetCode基本记录【2】19. Remove Nth Node From End of ListGiven a linked list, remove the nth node from the end of list and return its head.For example,Given linked list: 1->2->3->4->5,...原创 2018-03-20 22:55:23 · 291 阅读 · 0 评论 -
LeetCode基本记录【4】// BASIC NOTES AND CODES OF LEETCODE [ 4 ]
LeetCode基本记录【4】60. Permutation SequenceThe set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order, We get the following sequence (ie...原创 2018-03-31 00:54:47 · 227 阅读 · 0 评论 -
LeetCode小白菜笔记[13]:Maximum Subarray
LeetCode小白菜笔记[13]:Maximum Subarray53. Maximum Subarray [easy]题目如下:Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given t...原创 2018-02-09 16:51:04 · 280 阅读 · 0 评论 -
LeetCode小白菜笔记[17]:Sqrt(x)
LeetCode小白菜笔记[17]:Sqrt(x)69. Sqrt(x) [easy]Implement int sqrt(int x).Compute and return the square root of x.x is guaranteed to be a non-negative integer.Example 1:Input: 4Output: 2...原创 2018-02-10 01:52:54 · 173 阅读 · 0 评论 -
LeetCode小白菜笔记[16]:Add Binary
LeetCode小白菜笔记[16]:Add Binary67. Add Binary [easy]题目:Given two binary strings, return their sum (also a binary string).For example, a = "11" b = "1" Return "100".两个表示二进制数的string相加,结果用str...原创 2018-02-09 23:54:27 · 215 阅读 · 0 评论 -
LeetCode小白菜笔记[3]:Palindrome Number
LeetCode小白菜笔记[9]:Palindrome Number原创 2017-12-10 18:42:00 · 315 阅读 · 0 评论 -
LeetCode小白菜笔记[1]:Two Sum
LeetCode小白菜笔记[1]:Two SumTwo Sum [Easy]原创 2017-12-09 18:22:16 · 428 阅读 · 0 评论 -
LeetCode小白菜笔记[4]:Roman to Integer
LeetCode小白菜笔记[4]:Roman to Integer原创 2017-12-11 00:17:15 · 284 阅读 · 0 评论 -
LeetCode小白菜笔记[5]:Longest Common Prefix
LeetCode小白菜笔记[5]:Longest Common Prefix原创 2017-12-15 17:44:58 · 363 阅读 · 0 评论 -
LeetCode小白菜笔记[7]:Merge Two Sorted Lists
LeetCode小白菜笔记[7]:Merge Two Sorted Lists原创 2017-12-16 01:26:21 · 286 阅读 · 0 评论 -
LeetCode小白菜笔记[8]:Remove Duplicates from Sorted Array
LeetCode小白菜笔记[8]:Remove Duplicates from Sorted Array原创 2017-12-16 16:27:50 · 242 阅读 · 0 评论 -
LeetCode小白菜笔记[9]:Remove Element
LeetCode小白菜笔记[9]:Remove Element原创 2017-12-16 17:52:49 · 251 阅读 · 0 评论 -
LeetCode小白菜笔记[10]:Implement strStr()
LeetCode小白菜笔记[10]:Implement strStr()原创 2017-12-16 23:21:11 · 274 阅读 · 0 评论 -
LeetCode小白菜笔记[6]:Valid Parentheses
LeetCode小白菜笔记[6]:Valid Parentheses20. Valid Parentheses [Easy]题目:Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. The bracke原创 2017-12-15 19:23:42 · 284 阅读 · 0 评论 -
LeetCode小白菜笔记[12]:Count and Say
LeetCode小白菜笔记[12]:Count and Say38. count and say [easy]题目如下:The count-and-say sequence is the sequence of integers with the first five terms as following:1. 12. 113. 214. 12...原创 2018-02-08 23:05:12 · 268 阅读 · 0 评论 -
LeetCode小白菜笔记[11]:Search Insert Position
LeetCode小白菜笔记[11]:Search Insert Position原创 2018-01-20 18:30:24 · 329 阅读 · 0 评论 -
LeetCode小白菜笔记[15]:Plus One
LeetCode小白菜笔记[15]:Plus One66. Plus One [easy]题目如下:Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.You may assume the integer do not contain a...原创 2018-02-09 20:37:06 · 248 阅读 · 0 评论 -
LeetCode基本记录【5】// BASIC NOTES AND CODES OF LEETCODE [ 5 ]
LeetCode基本记录【5】78. SubsetsGiven a set of distinct integers, nums, return all possible subsets (the power set).Note: The solution set must not contain duplicate subsets.For example, If nums ...原创 2018-04-04 23:27:30 · 258 阅读 · 0 评论