- 博客(6)
- 资源 (4)
- 收藏
- 关注
原创 算法分析与设计丨第九周丨LeetCode(13)——Redundant Connection(Medium)
并查集算法题目链接:https://leetcode.com/problems/redundant-connection/description/题目描述:In this problem, a tree is an undirected graph that is connected and has no cycles.The given input is a grap
2017-10-21 10:52:19 227
原创 算法分析与设计丨第八周丨LeetCode(12)——Friend Circles(Medium)
题目链接:https://leetcode.com/problems/friend-circles/description/题目描述:There are N students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For exam
2017-10-20 19:54:11 235
原创 算法分析与设计丨第七周丨LeetCode(11)——Candy(Hard)
贪心算法题目链接:https://leetcode.com/problems/candy/description/这道题目主要是思路,有了思路便很好办了。之前我始终不太理解贪心算法究竟是什么意思,然后思考一番加做题后发现其实是利用局部的资源最优来判断,比如说这道题目的比左右两边ratings高的candy更多,Kruskal算法的始终取不构成回环的权值最小边,都是贪心算法的体现
2017-10-18 19:40:36 208
原创 编译原理丨第七周 ——1000. 词法分析程序设计 **
Description设一语言的关键词、运算符、分界符的个数与单词如下: struct { int number; string str[10]; } keywords={3,"int","main","return"} ; //关键词struct { int number; string str[10]; } operators ={5,"+","*","=","+=","*="
2017-10-18 16:39:42 3459 1
原创 算法分析与设计丨第六周丨LeetCode(10)——Best Time to Buy and Sell Stock(Easy)
class Solution {public: int maxProfit(vector& prices) { if(prices.empty()) return 0; int profit = 0; int budget = prices[0];
2017-10-13 19:26:58 304
原创 算法分析与设计丨第六周丨LeetCode(9)——Course Schedule(Medium)
拓扑排序题目链接:https://leetcode.com/problems/course-schedule/description/上周国庆休息,这周继续作业。这题用到了拓扑排序,都是以前数据结构说到的方法,看来得把书拿出来翻一翻了。#include #include#includeusing namespace std;class Solution {
2017-10-10 16:48:11 215
vivado license长期可用
2017-04-19
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人