算法刷题
文章平均质量分 66
syyyy712
你的格局决定你的结局!
展开
-
leetcode第四题.:Median of Two Sorted Arrays
题目:There are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).Example 1: nums1 = [...原创 2018-05-27 23:32:11 · 146 阅读 · 0 评论 -
面试常考排序算法
#include<iostream>#include<algorithm>using namespace std;//快排(最好结果是nlogn,最坏情况是n*n)void QuickSort(int arr[], int L, int R){ int pivot = arr[(L + R) / 2]; int i = L; int j = R; wh...原创 2018-10-25 16:12:56 · 1058 阅读 · 0 评论 -
求最长子序列和最长公共子串
又有一段时间没刷题,今天温故下,最长公共子序列和最长公共子串概念不一样,子序列可以不连续,子串必须连续,这两题均可以用动态规划解决!,下面程序在VS上跑过无问题!#include&lt;iostream&gt;#include&lt;string&gt;#include&lt;algorithm&gt;#include&lt;cmath&gt;using namespac原创 2018-10-25 15:08:21 · 222 阅读 · 0 评论 -
[LeetCode]62Unique Paths /63Unique Paths II/64Minimum Path Sum
62. 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...原创 2018-08-15 10:34:51 · 158 阅读 · 0 评论 -
[LeetCode]26Remove Duplicates from Sorted Array和27. Remove Element
26、题目描述:Given a sorted array nums, 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 ...原创 2018-08-14 15:36:38 · 130 阅读 · 0 评论 -
[LeetCode]Binary Tree Level Order Traversal (I II)和Binary Tree Zigzag Level Order Traversal
Binary Tree 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 level and alternate ...原创 2018-08-10 21:18:19 · 138 阅读 · 0 评论 -
[LeetCode]House Robber和House Robber||
House Robber题目描述:You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is ...原创 2018-08-10 20:35:29 · 612 阅读 · 0 评论 -
Leetcode 46. Permutations 和Leetcode 47. Permutations II
本文中这两题全排列的解法采用了STL中的函数next_permutation(),其返回值是布尔类型,next_permutation()函数是寻找当前排列之后的下一个排列,比如[1,2,3]后面的是[1,3,2],当找到[3,2,1]时发现没有下一个排列就会返回false。另外还有一个函数是prev_permutation(),该函数是寻找当前排列的前一个排列,比如当前排列是[1,3,2],那么...原创 2018-07-23 09:36:37 · 196 阅读 · 0 评论 -
Leetcode34. Find First and Last Position of Element in Sorted Array
描述:Given an array of integers nums sorted in ascending order, 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).I...原创 2018-07-14 14:30:03 · 471 阅读 · 0 评论 -
leetcode. 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.k is a positive integer and is less than or equal to the length of the linked list. If the numbe...原创 2018-07-13 11:13:48 · 152 阅读 · 0 评论 -
leetcode. Remove Duplicates from Sorted Array
描述:Given a sorted array nums, 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 by mo...原创 2018-07-13 10:33:16 · 127 阅读 · 0 评论 -
Valid Palindrome II
描述Given a non-empty string s, you may delete at most one character. Judge whether you can make it a palindrome.The string will only contain lowercase characters a-z. The maximum length of the stri...原创 2018-07-11 11:10:41 · 158 阅读 · 0 评论 -
Lintcode 链表划分
题目描述:给定一个单链表和数值x,划分链表使得所有小于x的节点排在大于等于x的节点之前。你应该保留两部分内链表节点原有的相对顺序。解释: 本道题目我的解法是先遍历链表,对于小于x的节点数据域压入pre数组中,其余节点数据域压入last数组,然后将pre和last分别顺序不变压入result数组中,最后再遍历链表,将链表中的每一个节点的数据域重新赋值为result数组中的数值。代码:...原创 2018-06-28 16:36:24 · 209 阅读 · 0 评论 -
leetcode第七题:Reverse Integer
题目:Given a 32-bit signed integer, reverse digits of an integer.Example 1: Input: 123 Output: 321Example 2: Input: -123 Output: -321Example 3: Input: 120 Output: 21Note: Assume we are ...原创 2018-06-27 18:57:08 · 242 阅读 · 0 评论 -
lintcode452. 删除链表中的元素
题目描述:删除链表中等于给定值val的所有节点。 样例 给出链表 1->2->3->3->4->5->3, 和 val = 3, 你需要返回删除3之后的链表:1->2->4->5。解决办法:针对该题,首先遍历链表,把节点值不等于val的节点数据域压入result数组,然后重新创建新链表Head,Head链表中的每一个节点...原创 2018-06-29 20:03:47 · 166 阅读 · 0 评论 -
动态规划题目—栅栏染色,打劫房屋
最近在lintcode上看动态规划的题目,总结了动态规划的一类题目,动态规划一般会用于求最优解,最大值等题目中,核心是找状态方程,请看以下题目:第一题:对于这类题目中出现不存在超过2个相邻这种字眼应该首先想到动态规划,所以接下来首先找状态转移方程,请看以下推导: 当n==1的时候,有k种; 当n==2的时候,有k*k种; 当n==3的时候,分两种情况: a.如果3和2...原创 2018-05-26 08:35:16 · 659 阅读 · 0 评论 -
[LeetCode] Largest Perimeter Triangle
题目描述:Given an array A of positive lengths, return the largest perimeter of a triangle with non-zero area, formed from 3 of these lengths.If it is impossible to form any triangle of non-zero area, re...原创 2019-01-17 20:16:43 · 216 阅读 · 0 评论