LeetCode刷题记录
文章平均质量分 83
我们都曾拥有最美的时光
https://github.com/Soulghost
展开
-
[LeetCode]Bulls and Cows
题目描述 题目要求对secret和guess进行比对,找出bull和cow,bull指的是位置相同且字符相同的情况,cow指的是guess中的数在secret中出现过,但是位置不同。 需要特别注意的是多个重复字符的情况,在匹配出一个bull后,那个字符就不能再被cow匹配了,因此需要计数当前还剩下多少个secret字符未被bull匹配。并且bull匹配优先于cow匹配。原创 2015-11-02 14:47:39 · 837 阅读 · 0 评论 -
[LeetCode]Additive Number
题目链接:Additive Number题目内容:Additive number is a positive integer whose digits can form additive sequence.A valid additive sequence should contain at least three numbers. Except for the first two numbers,原创 2015-11-23 14:34:30 · 1974 阅读 · 0 评论 -
[LeetCode]Range Sum Query - Mutable
题目链接:Range Sum Query - Mutable题目内容:Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.The update(i, val) function modifies nums by updating the element原创 2015-11-20 14:58:33 · 3806 阅读 · 0 评论 -
[LeetCode]Linked List Cycle II
题目链接:Linked List Cycle II题目内容:Given a linked list, return the node where the cycle begins. If there is no cycle, return null.Note: Do not modify the linked list.Follow up: Can you solve it without usi原创 2015-11-13 14:24:23 · 588 阅读 · 0 评论 -
[LeetCode]Perfect Squares
题目链接:Perfect Squares 题目内容: Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n. For example, given n = 12, return 3 be原创 2015-11-11 15:41:01 · 717 阅读 · 0 评论 -
[LeetCode]Serialize and Deserialize Binary Tree
题目链接:Serialize and Deserialize Binary Tree 题目内容: Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer原创 2015-11-06 14:36:51 · 741 阅读 · 0 评论 -
[LeetCode]Populating Next Right Pointers in Each Node
题目链接:Populating Next Right Pointers in Each Node 题目内容: Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }原创 2015-11-07 13:32:39 · 629 阅读 · 0 评论 -
[LeetCode]Binary Tree Zigzag Level Order Traversal
题目链接:Binary Tree Zigzag Level Order Traversal 题目内容: Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next le原创 2015-11-04 15:12:40 · 698 阅读 · 0 评论 -
[LeetCode]Longest Increasing Subsequence
这是一道典型的动态规划问题,通常有两种解法,一种自然的思想时间复杂度为O(n^2),而另一种巧妙地思路可以利用二分查找把时间复杂度降低到O(nlogn)。下面分别介绍这两种做法。原创 2015-11-03 17:22:37 · 1602 阅读 · 0 评论 -
[LeetCode]Unique Paths
题目链接Unique Paths题目内容A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).The robot can only move either down or right at any point in time. The robot is tryin原创 2016-09-04 20:14:47 · 564 阅读 · 0 评论