Leetcode
文章平均质量分 77
kelvinmao
这个作者很懒,什么都没留下…
展开
-
Leetcode解题笔记(Stack)
2016-07-22更新 94.Binary Tree Inorder TraversalGiven a binary tree, return the inorder traversal of its nodes’ values.For example: Given binary tree [1,null,2,3], return [1,3,2].题目要求完成二叉树中序遍历,递归解法太简原创 2016-07-20 21:59:59 · 519 阅读 · 0 评论 -
Leetcode解题笔记(string)
344.Reverse StringWrite a function that takes a string as input and returns the string reversed.Example: Given s = “hello”, return “olleh”.题意:给出字符串,将其反转,写出这样的函数。函数定义如下:char* reverseString(char* s) {}原创 2016-07-14 22:23:36 · 508 阅读 · 0 评论 -
Leetcode解题笔记(Linked List)
2016-07-15更新160.Intersection of Two Linked Lists Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists: begin to i原创 2016-07-15 19:13:28 · 720 阅读 · 0 评论 -
Leetcode解题笔记(Linked List)
2016-07-16更新:19.Remove Nth Node From End of List Given a linked list, remove the nth node from the end of list and return its head.For example, Note: Given n will always be valid. Try to do this原创 2016-07-16 22:38:26 · 430 阅读 · 0 评论 -
Leetcode解题笔记(Linked List)
2016-07-17更新:142.Linked List Cycle IIGiven a linked list, return the node where the cycle begins. If there is no cycle, return null.给定一个单链表,判断其是否带环,若带环返回环的入口结点,否则返回NULL.判断是否带环,快慢指针法就可以解决问题。要返回环的入口,就显得比原创 2016-07-17 21:37:11 · 478 阅读 · 0 评论 -
利用循环不变式写出正确的二分查找及其衍生算法
一.你能准确写出二分查找吗?先看看定义 二分查找的搜索过程从数组的中间元素开始,如果中间元素正好是要查找的元素,则查找成功;如果某一特定元素大于或者小于中间元素,则在数组大于或小于中间元素的那一半中查找,而且跟开始一样从中间元素开始比较。如果在某一步骤数组为空,则代表找不到。这种搜索算法每一次比较都使搜索范围缩小一半。思路很简单以至于大多数人都能讲出来,但是有多少人能一次写出bug-free的原创 2016-08-05 16:34:53 · 1296 阅读 · 0 评论 -
287.Find the Duplicate Number
287.Find the Duplicate NumberGiven an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is o原创 2016-08-13 12:02:28 · 460 阅读 · 0 评论 -
Leetcode解题笔记(Array)
源码见github https://github.com/Kelvinmao/Leetcode/tree/master/Array 2016-08-08更新154.Find Minimum in Rotated Sorted Array IIFollow up for “Find Minimum in Rotated Sorted Array”: What if duplicates are al原创 2016-07-23 22:38:02 · 7293 阅读 · 0 评论 -
Leetcode解题笔记(Linked List)
2016-07-20更新: 61.Rotate ListGiven a list, rotate the list to the right by k places, where k is non-negative.For example: Given 1->2->3->4->5->NULL and k = 2, return 4->5->1->2->3->NULL.这道题的大意是将元素向右移原创 2016-07-18 21:23:20 · 2339 阅读 · 0 评论