刷题
svdalv
这个作者很懒,什么都没留下…
展开
-
剑指Offer 刷题(1)
题目描述在一个二维数组中,每一行都按照从左到右递增的顺序排序,每一列都按照从上到下递增的顺序排序。请完成一个函数,输入这样的一个二维数组和一个整数,判断数组中是否含有该整数。 输入描述:array: 待查找的二维数组target:查找的数字输出描述:查找到返回true,查找不到返回false思路:由于数组中元素已经排好顺序,考虑到时间复杂度,我们从左下角进行查原创 2015-12-25 20:20:38 · 346 阅读 · 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 · 350 阅读 · 0 评论 -
leetcode4.MedianofTwoSortedArrays
首先对leetcode的编译运行吐槽一下:貌似没有超时判断,而且small和large的数据集相差很小。此题一开始我采用最笨的方法去实现,利用排序将两个数组合并成一个数组,然后返回中位数:[cpp] view plain copy print?class Solution { public: double findMedi转载 2016-05-03 22:27:16 · 285 阅读 · 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 · 298 阅读 · 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 · 320 阅读 · 0 评论 -
leetcode15.3Sum
Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:Elements in a triplet (a,b,c)原创 2016-04-21 15:59:55 · 295 阅读 · 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 · 365 阅读 · 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 · 408 阅读 · 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 · 153 阅读 · 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 评论 -
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 评论 -
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 · 285 阅读 · 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 · 328 阅读 · 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 · 309 阅读 · 0 评论 -
剑指offer刷题(2)
题目描述请实现一个函数,将一个字符串中的空格替换成“%20”。例如,当字符串为We Are Happy.则经过替换之后的字符串为We%20Are%20Happy。思路如果从前往后进行遍历,那么每次找到一个空格,则需要添加两个字节来进行替换,我们采用先对字符串进行遍历,查找字符串中的空格的个数,然后对新的字符串进行长度的计算,然后从后往前进行替换,每遇到一个空字符,然后进行替换。cl原创 2015-12-25 20:29:03 · 320 阅读 · 0 评论 -
剑指Offer刷题(3)
题目描述输入一个链表,从尾到头打印链表每个节点的值。 输入描述:输入为链表的表头输出描述:输出为需要打印的“新链表”的表头思路:我们可以通过一个vector,然后不断在开始处其中插入链表的表头元素。代码如下:/*** struct ListNode {* int val;* struct ListNode *next;原创 2015-12-25 21:27:33 · 318 阅读 · 0 评论 -
剑指Offer刷题(4)
题目描述输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6},则重建二叉树并返回。解题思路:首先,回忆一下二叉树的概念。二叉树。介绍一个例子:前序遍历为abdefgc中序遍历为debfgac后续遍历为edgfb原创 2015-12-25 22:51:41 · 331 阅读 · 0 评论 -
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 · 334 阅读 · 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 · 329 阅读 · 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 · 322 阅读 · 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 · 333 阅读 · 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 · 302 阅读 · 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 · 296 阅读 · 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 · 384 阅读 · 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 · 355 阅读 · 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 · 290 阅读 · 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 · 290 阅读 · 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 评论