leetcode
svdalv
这个作者很懒,什么都没留下…
展开
-
leetcode19.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 linke原创 2016-01-30 13:26:49 · 332 阅读 · 0 评论 -
leetcode10.RegularExpressionMatching
'.' Matches any single character.'*' Matches zero or more of the preceding element.The matching should cover the entire input string (not partial).The function prototype should be:bool isMatch原创 2016-04-17 17:20:17 · 344 阅读 · 0 评论 -
leetcode4.MedianofTwoSortedArrays
首先对leetcode的编译运行吐槽一下:貌似没有超时判断,而且small和large的数据集相差很小。此题一开始我采用最笨的方法去实现,利用排序将两个数组合并成一个数组,然后返回中位数:[cpp] view plain copy print?class Solution { public: double findMedi转载 2016-05-03 22:27:16 · 283 阅读 · 0 评论 -
leetcode11.ContainerWithMostWater
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two原创 2016-04-20 11:12:54 · 296 阅读 · 0 评论 -
leetcode12.IntegerToRoman&&RomanToInteger
1.Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.本题目主要讲解罗马数字与十进制数字的转化。第一个为给定一个十进制数字,转化为罗马数字。先了解一下罗马数字的格式。1~9: {"I", "II",原创 2016-04-21 14:41:17 · 317 阅读 · 0 评论 -
leetcode16.3SumClosest
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly原创 2016-04-23 11:03:46 · 299 阅读 · 0 评论 -
leetcode之贪心算法
455. Assign CookiesAssume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a greed factor gi, which原创 2017-07-05 11:27:15 · 363 阅读 · 0 评论 -
leetcode之分治总结
169. Majority Element题目描述:给定一个数组,求该数组中出现超过一半的数字。解题思路:Moore Voting代码如下:class Solution {public: int majorityElement(vector& nums) { int candidate=nums[0]; int ret=1;原创 2017-08-05 12:12:26 · 403 阅读 · 0 评论 -
leetcode888. Fair Candy Swap
description:Alice and Bob have candy bars of different sizes:A[i]is the size of thei-th bar of candy that Alice has, andB[j]is the size of thej-th bar of candy that Bob has.Since they are fr...原创 2019-03-04 22:05:44 · 111 阅读 · 0 评论 -
leetcode 509. Fibonacci Number
比较经典的算法题,Fibonacci序列:solution 1 :递归class Solution {public: int fib(int N) { if(N<=1){ return N; } return fib(N-1) + fib(N-2); }};soluti...原创 2019-03-02 15:39:37 · 113 阅读 · 0 评论 -
leetcode766.Toeplitz Matrix
Description:A matrix isToeplitzif every diagonal from top-left to bottom-right has the same element.Now given anM x Nmatrix, returnTrueif and only if the matrix isToeplitz.demo:Input:mat...原创 2019-03-02 16:28:00 · 151 阅读 · 0 评论 -
leetcode566. Reshape the Matrix
Description:In MATLAB, there is a very useful function called 'reshape', which can reshape a matrix into a new one with different size but keep its original data.You're given a matrix represented ...原创 2019-03-02 17:39:03 · 161 阅读 · 0 评论 -
leetcode976. Largest Perimeter Triangle
url:https://leetcode.com/problems/largest-perimeter-triangle/description:Given an arrayAof positive lengths, return the largest perimeter of a triangle withnon-zero area, formed from 3 of these...原创 2019-03-02 17:49:11 · 188 阅读 · 0 评论 -
leetcode283. Move Zeroes
题目链接:https://leetcode.com/problems/move-zeroes/题目描述:Given an arraynums, write a function to move all0's to the end of it while maintaining the relative order of the non-zero elements.Example:...原创 2019-03-05 23:37:00 · 111 阅读 · 0 评论 -
leetcode 977. Squares of a Sorted Array
题目链接:https://leetcode.com/problems/squares-of-a-sorted-array/题目描述:Given an array of integers A sorted in non-decreasing order, return an array of the squares of each number, also in sorted non-dec...原创 2019-02-27 00:09:03 · 139 阅读 · 0 评论 -
leetcode169. Majority Element
题目链接:https://leetcode.com/problems/majority-element/题目描述:Given an array of sizen, find the majority element. The majority element is the element that appearsmore than⌊ n/2 ⌋times.You may a...原创 2019-03-09 13:16:37 · 121 阅读 · 0 评论 -
leetcode167. Two Sum II - Input array is sorted
网址url:https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/Given an array of integers that is alreadysorted in ascending order, find two numbers such that they add up to a specific target...原创 2019-03-09 14:36:39 · 122 阅读 · 0 评论 -
leetcode448. Find All Numbers Disappeared in an Array
题目链接:https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/题目描述:Given an array of integers where 1 ≤ a[i] ≤n(n= size of array), some elements appear twice and others appear onc...原创 2019-03-06 23:04:02 · 112 阅读 · 0 评论 -
leetcode80. Remove Duplicates from Sorted Array II
Follow up for "Remove Duplicates":What if duplicates are allowed at most twice?For example,Given sorted array nums = [1,1,1,2,2,3], Your function should return length = 5, with the first five原创 2016-04-27 22:50:46 · 270 阅读 · 0 评论 -
leetcode26.RemoveDuplicatesfromSortedArray
Given a sorted array, remove the duplicates in place such that each element appear onlyonce and return the new length.Do not allocate extra space for another array, you must do this in place with原创 2016-04-27 22:29:14 · 271 阅读 · 0 评论 -
leetcode5.LongestPalindromicSubstring
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.解题思路:给定一个字符串,求这个字符原创 2016-04-14 19:45:12 · 346 阅读 · 0 评论 -
leetcode20.ValidParentheses
原题如下: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 val原创 2016-01-30 21:12:57 · 327 阅读 · 0 评论 -
leetcode21.MergeTwoSorted Lists
题目原文如下:Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.题目为给定两个有序的链表,然后将这两个链表合成一个,思想很简单,重新建立一个节点,两个指针分别指向这原创 2016-01-30 23:04:19 · 320 阅读 · 0 评论 -
leetcode26RemoveDuplicatesfromSortedArray
原题目如下:Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in place wi原创 2016-01-31 22:43:18 · 332 阅读 · 0 评论 -
leetcode102.BinaryTreeLevelOrderTraversal
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree {3,9,20,#,#,15,7}, 3 / \ 9 20原创 2016-03-16 11:17:18 · 300 阅读 · 0 评论 -
leetcode107.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).For example:Given binary tree {3,9,20,#,#,15,7},原创 2016-03-17 20:15:10 · 294 阅读 · 0 评论 -
leetcode111.MinimumDepthofBinary Tree
Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.解题思路:采用递归的方法来解决这个问题,其实递归可以解决的问题都可以原创 2016-03-17 21:06:16 · 345 阅读 · 0 评论 -
leetcode112.PathSum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below binary tree and sum原创 2016-03-17 22:08:55 · 337 阅读 · 0 评论 -
leetcode83.RemoveDuplicatesFromSortedList
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->2->3->3, return 1->2->3.解题思路: 有顺序的单链表的删除。如果存在原创 2016-03-09 22:14:52 · 355 阅读 · 0 评论 -
leetcode88.MergeSortedArray
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note:You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold add原创 2016-03-09 22:49:36 · 280 阅读 · 0 评论 -
leetcode101.SymmetricTree
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \3 4 4 3But the f原创 2016-03-10 22:30:10 · 382 阅读 · 0 评论 -
leetcode66.PlusOne
Title: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.Subscribe to s原创 2016-02-29 21:17:30 · 353 阅读 · 0 评论 -
leetcode67.AddBinary
Given two binary strings, return their sum (also a binary string).For example,a = "11",b = "1".Return "100".解题思路:其实是求二进制的加法,不过用字符串来进行表示。与数据结构中两个链表的合并的算法有些类似。代码如下:class Solution {public:原创 2016-02-29 21:59:43 · 313 阅读 · 0 评论 -
leetcode189.RotateArray
Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].Note:Try to come up as many solutions as you can, t原创 2016-04-07 15:41:35 · 289 阅读 · 0 评论 -
leetcode118. 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]]其实是求杨辉三角的算法,可以看出每一行的数据是上原创 2016-03-27 22:08:08 · 288 阅读 · 0 评论 -
leetcode119.Pascal'sTriangleII
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?第一种方法就是直原创 2016-03-27 22:52:34 · 307 阅读 · 0 评论 -
leetcode125.ValidPalindrome
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 palindrome."race a car" is not a原创 2016-03-29 10:45:55 · 326 阅读 · 0 评论 -
leetcode155.MinStack
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.top() -- Ge原创 2016-03-29 11:22:23 · 284 阅读 · 0 评论 -
leetcode697. Degree of an Array
url :https://leetcode.com/problems/degree-of-an-array/Description:Given a non-empty array of non-negative integersnums, thedegreeof this array is defined as the maximum frequency of any one of ...原创 2019-03-11 22:40:31 · 135 阅读 · 0 评论