![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
LeetCode
文章平均质量分 58
chfe910
这个作者很懒,什么都没留下…
展开
-
LeetCode[Backtracking]: Letter Combinations of a Phone Number
Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telephone buttons) is given below. Inpu原创 2017-08-28 10:29:06 · 410 阅读 · 0 评论 -
LeetCode[Tree]: Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.这类问题非常适合用递归做,递归思路如下:前序遍历的第一个节点必然是根节点,中序遍历中根节点之前的节原创 2014-12-03 19:59:22 · 810 阅读 · 0 评论 -
LeetCode[Linked list]: Rotate List
Given 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.看到这个题目感到奇怪的是为什么是“右旋”,而不是“左旋原创 2014-11-02 12:21:37 · 758 阅读 · 0 评论 -
LeetCode[Tree]: Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).这个题目比较简单,借助容器queue即可完成二叉树的层序遍历。我的C++实现代码如下:vector > levelOrder(TreeNode *原创 2014-11-27 22:33:39 · 565 阅读 · 0 评论 -
LeetCode[Array]: Merge Sorted Array
Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from B.原创 2014-10-31 22:19:23 · 613 阅读 · 0 评论 -
LeetCode[Hash Table]: Valid Sudoku
Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character '.'.A partially filled su原创 2014-11-24 01:04:27 · 1491 阅读 · 0 评论 -
LeetCode[String]: Add Binary
Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".我的C++实现代码如下:string addBinary(string a, string b) { string sum; int c原创 2014-11-26 20:53:40 · 819 阅读 · 0 评论 -
LeetCode[Array]: Search a 2D Matrix
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left to right.The first integer of each row原创 2014-11-30 15:55:20 · 724 阅读 · 0 评论 -
LeetCode[Array]: Plus One
Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.一开始我误解了题目的意思,以为是新建一个原创 2014-10-31 21:08:36 · 1105 阅读 · 0 评论 -
LeetCode[Array]: Pascal's Triangle
Given numRows, generate the first numRows of Pascal's triangle.For example, given numRows = 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]]这个问题比较简单,大家的解法大同小异。时间复杂度都原创 2014-10-31 23:18:42 · 796 阅读 · 0 评论 -
LeetCode[string]: Length of Last Word
Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.If the last word does not exist, return 0.Note: A word is defin原创 2014-11-06 13:02:45 · 774 阅读 · 0 评论 -
LeetCode[Array]: Find Minimum in Rotated Sorted Array
Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).Find the minimum element.You may assume no duplicate exists in the原创 2014-11-06 16:14:30 · 747 阅读 · 0 评论 -
LeetCode[Linked List]: Intersection of Two Linked Lists
Write a program to find the node at which the intersection of two singly linked lists begins.Notes:If the two linked lists have no intersection at all, return null.The linked lists must retain t原创 2014-11-28 20:31:58 · 715 阅读 · 0 评论 -
LeetCode[Array]: Set Matrix Zeroes
Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.Follow up:Did you use extra space?A straight forward solution using O(mn) space is probably a bad ide原创 2014-11-30 15:33:45 · 631 阅读 · 0 评论 -
LeetCode[Array]: Remove Element
Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't matter what you leave beyond the new length.方原创 2014-10-31 00:38:11 · 869 阅读 · 0 评论 -
LeetCode[Linked List]: Copy List with Random Pointer
A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy of the list./** * Definition for singly-linke原创 2014-11-02 20:17:27 · 706 阅读 · 0 评论 -
LeetCode[Linked List]: Linked List Cycle
Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?这个题目如果没有空间复杂度O(1)的限制,我可以想到的方法就是:遍历整个list,将每个节点的地址存入一个vector,如果发现某个节点的next的地址已经在vec原创 2014-11-26 17:04:27 · 794 阅读 · 0 评论 -
LeetCode[Hash Table]: Two Sum
Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, where原创 2014-11-24 13:51:39 · 1339 阅读 · 3 评论 -
LeetCode[Linked List]: 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,Given linked list: 1->2->3->4->5, and n = 2.After removing the second node from the end, the linked原创 2014-11-03 19:25:18 · 844 阅读 · 0 评论 -
LeetCode[Tree]: Binary Tree Level Order Traversal II
Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).这个简单的问题可以这样解决:利用LeetCode[Tree]: Binary Tree Level原创 2014-11-27 23:37:18 · 544 阅读 · 0 评论 -
LeetCode[Array]: Pascal's Triangle II
Given an index k, return the kth row of the Pascal's triangle.For example, given k = 3,Return [1,3,3,1].Note:Could you optimize your algorithm to use only O(k) extra space?这个问题比较简单。v原创 2014-11-26 13:35:37 · 812 阅读 · 0 评论 -
LeetCode[Linked List]: Linked List Cycle II
Given a linked list, return the node where the cycle begins. If there is no cycle, return null.Follow up:Can you solve it without using extra space?这个题目跟Linked List Cycle一样,我也没有能够自己独立找到解决方法,原创 2014-11-26 17:47:34 · 856 阅读 · 0 评论 -
LeetCode[Backtracking]: Subsets
Given a set of distinct integers, S, return all possible subsets. Note: Elements in a subset must be in non-descending order. The solution set must not contain duplicate subsets. For exampl原创 2015-03-23 15:54:15 · 1000 阅读 · 0 评论 -
LeetCode[Dynamic Programming]: Maximum Product Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest product. For example, given the array [2,3,-2,4], the contiguous subarray [2,3] has the largest原创 2015-03-27 17:20:32 · 699 阅读 · 0 评论 -
LeetCode[String]: Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.这个题目非常简单,只要弄清楚题意就可以非常快地解决,我的C++代码实现如下: string longestCommonPrefix(vector<string> &strs) { if (strs.empt原创 2015-03-04 17:06:28 · 963 阅读 · 0 评论 -
LeetCode[stack]: Min Stack
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. - push(x) – Push element x onto stack. - pop() – Removes the element on top of the stack. - to原创 2015-03-04 16:47:40 · 981 阅读 · 0 评论 -
LeetCode[Math]: Roman to Integer
Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999.这个题目首先要了解罗马数字的拼写规则(以下引自维基百科):罗马数字共有7个,即I(1)、V(5)、X(10)、L(50)、C(100)、D(500)和M(1000)。按照下述的规则原创 2015-03-03 13:36:26 · 876 阅读 · 1 评论 -
LeetCode[String]: Valid Number
Validate if a given string is numeric. Some examples: "0" => true " 0.1 " => true "abc" => false "1 a" => false "2e10" => true Note: It is intended for the problem statement to be原创 2015-03-03 15:47:08 · 792 阅读 · 0 评论 -
LeetCode[Math]: Integer to Roman
Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999.欲了解罗马数字的拼写规则请参考:http://blog.csdn.net/chfe007/article/details/44037079C++代码实现如下: string原创 2015-03-03 14:46:32 · 759 阅读 · 0 评论 -
LeetCode[Map]: Longest Consecutive Sequence
Given an unsorted array of integers, find the length of the longest consecutive elements sequence. For example, Given [100, 4, 200, 1, 3, 2], The longest consecutive elements sequence is [1, 2原创 2015-03-02 13:14:45 · 800 阅读 · 0 评论 -
LeetCode[BFS]: Surrounded Regions
Given a 2D board containing ‘X’ and ‘O’, capture all regions surrounded by ‘X’. A region is captured by flipping all ‘O’s into ‘X’s in that surrounded region. For example, X X X X X O O X原创 2015-03-02 18:29:07 · 720 阅读 · 0 评论 -
LeetCode[Tree]: Binary Search Tree Iterator
Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST. Calling next() will return the next smallest number in the BST. Note: next()原创 2015-03-03 00:23:08 · 1322 阅读 · 0 评论 -
LeetCode[Linked List]: 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.If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is.原创 2014-11-01 19:53:53 · 824 阅读 · 0 评论 -
LeetCode[Linked List]: Reverse Linked List II
Reverse a linked list from position m to n. Do it in-place and in one-pass.For example:Given 1->2->3->4->5->NULL, m = 2 and n = 4,return 1->4->3->2->5->NULL.Note:Given m, n satisfy the f原创 2014-11-04 19:45:06 · 634 阅读 · 0 评论 -
LeetCode[Linked List]: Remove Duplicates from Sorted List II
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.For example,Given 1->2->3->3->4->4->5, return 1->2->5.Given 1原创 2014-11-04 20:42:59 · 824 阅读 · 0 评论 -
LeetCode[stack]: Valid Parentheses
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}" are all valid bu原创 2014-11-04 23:37:20 · 731 阅读 · 0 评论 -
LeetCode[Array]: Search for a Range
Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the order of O(log n).If the target is not found in t原创 2014-12-06 00:39:22 · 744 阅读 · 0 评论 -
LeetCode[Linked List]: Partition List
Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the nodes in each of t原创 2014-11-22 17:59:03 · 694 阅读 · 0 评论 -
LeetCode[Math]: Sqrt(x)
Implement int sqrt(int x). Compute and return the square root of x.这个题目适合用位操作来做,时间和空间复杂度都是O(1)。首先找到根的最高位,然后从最高位开始,依次判断各个位值是否为1。C++代码实现如下: int sqrt(int x) { int i, j, res = 0;原创 2015-02-01 20:01:53 · 680 阅读 · 0 评论 -
LeetCode[Array]: Trapping Rain Water
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. For example, Given [0,1,0,2,1,0,1,3,2,1,2,1],原创 2015-02-01 16:52:55 · 869 阅读 · 0 评论