leetcode
文章平均质量分 72
what_lei
一只来自电子与通信的研究僧
展开
-
leetcode:单链表之Reverse Linked List II
leetcode:单链表之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->nullptr, m = 2 and n = 4,return 1->4->3->2-原创 2016-08-03 14:45:03 · 370 阅读 · 0 评论 -
leetcode:单链表之Partition List
leetcode:单链表之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 relati原创 2016-08-03 16:12:08 · 476 阅读 · 0 评论 -
leetcode:单链表之Remove Duplicates from Sorted List
leetcode:单链表之Remove Duplicates from Sorted List题目:Given a sorted linked list, delete all duplicates such that each element appear only once.For example,Given 1->1->2, return 1->2.Given 1->1-原创 2016-08-03 16:54:13 · 245 阅读 · 0 评论 -
leetcode:单链表之Rotate List
leetcode:单链表之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->nullptr and k = 2, return 4->5->1->2->3->nullptr.原创 2016-08-04 10:53:41 · 276 阅读 · 0 评论 -
leetcode:单链表之Remove Nth Node From End of List
leetcode:单链表之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.Afte原创 2016-08-04 11:15:24 · 380 阅读 · 0 评论 -
leetcode:字符串之Anagrams
leetcode:字符串之Anagrams题目:Given an array of strings, return all groups of strings that are anagrams.Note: All inputs will be in lower-case.For example,Input: ["tea","and","ate","eat",原创 2016-08-11 17:50:44 · 362 阅读 · 0 评论 -
leetcode:字符串之Simplify Path
leetcode:字符串之Simplify Path题目:Given an absolute path for a file (Unix-style), simplify it.For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c"Corner Cases:• Did you co原创 2016-08-11 16:24:42 · 466 阅读 · 0 评论 -
leetcode:字符串之Length of Last Word
leetcode:字符串之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原创 2016-08-11 18:17:55 · 691 阅读 · 0 评论 -
leetcode:暴力枚举法之Subsets II
leetcode:暴力枚举法之Subsets II题目;Given a collection of integers that might contain duplicates, S, return all possible subsets.Note:Elements in a subset must be in non-descending order. The solution原创 2016-08-13 12:22:07 · 411 阅读 · 0 评论 -
leetcode:暴力枚举法之Subsets
leetcode:暴力枚举法之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 dupl原创 2016-08-13 11:24:33 · 673 阅读 · 0 评论 -
leetcode:暴力枚举法之Permutations
leetcode:暴力枚举法之Permutations题目:Given a collection of numbers, return all possible permutations.For example, [1,2,3] have the following permutations: [1,2,3], [1,3,2], [2,1,3], [2,3,1],[3,1,2],原创 2016-08-14 14:26:46 · 734 阅读 · 0 评论 -
leetcode:暴力枚举法之Combinations
leetcode:暴力枚举法之Combinations题目;Given two integers n and k, return all possible combinations of k numbers out of 1...n.For example, If n = 4 and k = 2, a solution is:[ [2,4], [3,4],原创 2016-08-15 11:08:36 · 675 阅读 · 0 评论 -
leetcode:字符串之Valid Palindrome && Palindrome Number
leetcode:字符串之Valid Palindrome题目:Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,”A man, a plan, a canal: Panama” is a p原创 2016-08-10 12:20:14 · 305 阅读 · 0 评论 -
leetcode:数组之Remove Element
leetcode:数组之Remove Element给定一数组及要删除的元素,返回删除元素后数组的长度。C++实现#include using namespace std;int removeElement(int a[],int n,int elem){ int index =0; for(int i=0;i<n;i++) { if(a[i]!=elem)原创 2016-08-01 15:24:28 · 228 阅读 · 0 评论 -
leetcode:数组之Two Sum
leetcode:数组之Two Sum给定一个数组,与一个目标值,然后从数组中找出两个元素之和等于目标值,输出这两个元素的下标索引。例如:数组a=[2,11,7,15],目标值9,输出下标索引为index1=1,index2=3;c++实现:#include #include #include using namespace std;vector twoS原创 2016-07-29 14:18:31 · 463 阅读 · 0 评论 -
leetcode:单链表之Remove Duplicates from Sorted List II
leetcode:单链表之Remove Duplicates from Sorted List II题目:Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbersfrom the original list.For example,原创 2016-08-03 18:25:25 · 418 阅读 · 0 评论 -
leetcode:数组之Rotate Image
leetcode:数组之Rotate Image给定一二维数组,将其旋转90度。例如C++实现:#include #include using namespace std;void rotate(vector>& matrix) { const int n = matrix.size(); for (int i = 0; i < n; ++i) /原创 2016-08-01 15:54:21 · 288 阅读 · 0 评论 -
leetcode: 单链表之Add Two Numbers
leetcode: 单链表之Add Two Numbers题目:You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the原创 2016-08-02 17:34:52 · 263 阅读 · 0 评论 -
leetcode:二叉树之Binary Tree Preorder Traversal
leetcode:二叉树之Binary Tree Preorder Traversal题目:Given a binary tree, return the preorder traversal of its nodes’ values.For example,Given binary tree {1,#,2,3}, 1 \ 2原创 2016-08-18 12:03:13 · 333 阅读 · 0 评论 -
leetcode:二叉树之Binary Tree Inorder Traversal
leetcode:二叉树之Binary Tree Inorder TraversalGiven a binary tree, return the inorder traversal of its nodes’ values.For example: Given binary tree {1,#,2,3}, 1 \ 2原创 2016-08-18 12:36:20 · 319 阅读 · 0 评论 -
leetcode:二叉树之Binary Tree Postorder Traversal
leetcode:二叉树之Binary Tree Postorder TraversalGiven a binary tree, return the postorder traversal of its nodes’ values.For example: Given binary tree {1,#,2,3}, 1 \ 2 /原创 2016-08-18 12:45:57 · 271 阅读 · 0 评论 -
leetcode:二叉树之Construct Binary Tree from Inorder and Postorder Traversal
leetcode:二叉树之Construct Binary Tree from Inorder and Postorder Traversal题目:Given inorder and postorder traversal of a tree, construct the binary tree.Note: You may assume that duplicates do not e原创 2016-08-19 11:28:40 · 360 阅读 · 0 评论 -
leetcode:二叉树之Construct Binary Tree from Preorder and Inorder Traversal
leetcode:二叉树之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 exi原创 2016-08-19 11:07:38 · 407 阅读 · 0 评论 -
leetcode:Spiral Matrix II
leetcode:Spiral Matrix II 题目:Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.For example,Given n = 3,You should return the following matrix原创 2016-08-30 22:32:57 · 460 阅读 · 0 评论 -
leetcode:数组:Remove Duplicates from Sorted Array
leetcode:数组之Remove Duplicates from Sorted Array去除有序数组中重复的元素,例如a=[1,1,2,3];输出a=[1,2,3],返回数组长度。c++实现#includeusing namespace std;int removeDuplicate(int a[],int n){ if(n==0) return 0; int i原创 2016-07-21 16:29:44 · 431 阅读 · 0 评论 -
leetcode:数组之Search in Rotated Sorted Array
leetcode:数组之Search in Rotated Sorted Array给定一个有序数组,使其以某一个数为轴,将其之前的所有数都旋转到数组的末尾,例如:a=[0,1,2,4,5,6,7]选转后为a=[4,5,6,7,0,1,2];在旋转后的数组查找某一个元素。二分查找法是要应用在有序的数组上,如果是无序的,那么二分查找就没有意义了,但旋转后的数组为一特例。下面用二分查找原创 2016-07-22 12:20:02 · 335 阅读 · 0 评论 -
leetcode:数组之Longest Consecutive Sequence
leetcode:数组之Longest Consecutive Sequence,给定一个乱序的数组,输出数组中连续的序列长度,例如,输入a=[100,4,200,1,3,2],输出最大连续序列长度length=4;分析:由于数组为无序数组,则首先想到哈希表,即利用一个哈希表unordered_map used 记录每个元素是否使用,对每个元素,以该元素为中心,向左右扩张,直到不连续为止,原创 2016-07-29 13:28:22 · 292 阅读 · 0 评论 -
leetcode:Reverse Integer
leetcode:Reverse Integer题目:Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321Have you thought about this?Here are some good questions to ask before c原创 2016-09-07 10:43:02 · 397 阅读 · 0 评论