算法分析与设计
小马快跑----
这个作者很懒,什么都没留下…
展开
-
LeetCode week 2 : Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters。最长无重复字符子字符串原创 2017-09-13 22:57:30 · 180 阅读 · 0 评论 -
LeetCode week 14: Coin Change
题目地址: https://leetcode.com/problems/coin-change/description/ 类别: 动态规划 难度: Medium 描述: You are given coins of different denominations and a total amount of money amount. Write a function to compute th原创 2017-12-05 19:09:27 · 177 阅读 · 0 评论 -
LeetCode week 17 : Number of Atoms
题目地址: https://leetcode.com/problems/number-of-atoms/description/ 类别: Stack 难度: Hard 描述: Given a chemical formula (given as a string), return the count of each atom.An atomic element always starts wi原创 2017-12-23 23:39:16 · 371 阅读 · 0 评论 -
LeetCode week 13 : Longest Consecutive Sequence
题目地址: https://leetcode.com/problems/longest-consecutive-sequence/description/ 类别: Union Find 难度: Hard 描述: Given an unsorted array of integers, find the length of the longest consecutive elements seq原创 2017-11-27 20:50:37 · 172 阅读 · 0 评论 -
LeetCode week 16 : Insert Interval
题目地址: https://leetcode.com/problems/insert-interval/description/ 类别: Sort 难度: Hard 描述: Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).You may原创 2017-12-17 13:11:32 · 180 阅读 · 0 评论 -
NP-complete Exercise
(a)令G 为一个环,环上顶点数等于H的顶点数。因此若G 是 H 的同构子图,则说明 H 存在 Rudrata 回路。 (b)令 g = 顶点数 −1,即为 Rudrata 路径。 (c)令 g 为子句总数,即为 SAT。 (d)令 b = a(a-1)/ 2,则a 个顶点两两相连,即为最大团问题。 (e)令b = 0,即为最大独立集问题。 (f)即为最小顶点覆盖的推广。 (g)TSP。原创 2018-01-03 15:09:50 · 242 阅读 · 0 评论 -
多个字符串不同单词总数统计(大小写不敏感)
多个字符串不同单词总数统计(大小写不敏感)#include<string>#include<iostream>#include<vector>#include<cctype>#include<algorithm>using namespace std;int main(void){ vector<str...原创 2018-03-10 21:51:05 · 363 阅读 · 0 评论 -
LeetCode week 15 : Coin Change2
题目地址: https://leetcode.com/problems/coin-change-2/description/ 类别: 动态规划 难度: Medium 描述: You are given coins of different denominations and a total amount of money. Write a function to compute the num原创 2017-12-11 17:31:42 · 287 阅读 · 0 评论 -
LeetCode week 12 : Course Schedule
题目地址: https://leetcode.com/problems/course-schedule/description/ 类别: Topological Sort 难度: Medium 描述: There are a total of n courses you have to take, labeled from 0 to n - 1.Some courses may have pr原创 2017-11-23 04:00:10 · 154 阅读 · 0 评论 -
LeetCode week 10 : Edit Distance
题目地址: https://leetcode.com/problems/edit-distance/description/ 类别: Dynamic Programming 难度: Hard 描述: Given two words word1 and word2, find the minimum number of steps required to convert word1 to原创 2017-11-04 00:54:10 · 276 阅读 · 0 评论 -
LeetCode week 1 : Reverse Pairs(493)
题目:https://leetcode.com/problems/reverse-pairs/description/题目类别:分治法,hard题目描述:Given an array nums, we call (i, j) an important reverse pair if i and nums[i] > 2*nums[j].You need to原创 2017-09-10 17:25:17 · 268 阅读 · 0 评论 -
LeetCode week 4 : Median of Two Sorted Arrays
两有序数组中位数,两有序数组第k大数原创 2017-09-28 21:15:54 · 221 阅读 · 0 评论 -
LeetCode week 3 : 24 Game
leetcode,24-game,Deep-first Search ,Hard ,C++原创 2017-09-22 15:45:27 · 3879 阅读 · 0 评论 -
LeetCode week 9 : Number of Longest Increasing Subsequence
题目地址: https://leetcode.com/problems/number-of-longest-increasing-subsequence/description/ 类别: Dynamic Programming 难度: Medium 描述: Given an unsorted array of integers, find the number of longest i原创 2017-10-30 22:47:26 · 179 阅读 · 0 评论 -
LeetCode week 5 : Assign Cookies
assign-cookies,Greedy , Easy ,leetcode,C++原创 2017-10-16 19:40:42 · 140 阅读 · 0 评论 -
LeetCode week 6 : Jump Game
题目地址: https://leetcode.com/problems/jump-game/description/ 类别: Greedy 难度: Medium 描述: Given an array of non-negative integers, you are initially positioned at the first index of the array. E原创 2017-10-16 23:36:23 · 152 阅读 · 0 评论 -
LeetCode week 7 : Jump Game II
题目地址: https://leetcode.com/problems/jump-game-ii/description/ 类别: Greedy 难度: Hard 描述: Given an array of non-negative integers, you are initially positioned at the first index of the array.Each原创 2017-10-17 13:38:13 · 176 阅读 · 0 评论 -
LeetCode week 8 : Longest Increasing Subsequence
题目地址: https://leetcode.com/problems/longest-increasing-subsequence/description/ 类别: Dynamic Programming 难度: Medium 描述: Given an unsorted array of integers, find the length of longest increasing原创 2017-10-26 11:24:13 · 179 阅读 · 0 评论 -
LeetCode week 11 : Regular Expression Matching
题目地址: https://leetcode.com/problems/edit-distance/description/ 类别: Dynamic Programming 难度: Hard 描述: Implement regular expression matching with support for ‘.’ and ‘*‘.‘.’ Matches any single charact原创 2017-11-13 16:17:28 · 148 阅读 · 0 评论