03 2019 档案

摘要:LeetCode中的一题,虽然结果没问题,但是超时了,下面的操作真的辣眼睛,记录一下犯蠢。 阅读全文
posted @ 2019-03-22 19:11 Lightmonster 阅读(178) 评论(0) 推荐(0)
摘要:13-1 13-2 13-3 13-4 阅读全文
posted @ 2019-03-12 22:31 Lightmonster 阅读(246) 评论(0) 推荐(0)
摘要:冒泡排序的数组和向量实现 向量唯一化实现 向量-归并排序 阅读全文
posted @ 2019-03-09 16:51 Lightmonster 阅读(313) 评论(0) 推荐(0)
摘要:#include "pch.h" #include #include #include #include #include #include #include using namespace std; inline void eatline() { while (cin.get() != '\n') continue; } struct planet { char name... 阅读全文
posted @ 2019-03-07 21:12 Lightmonster 阅读(334) 评论(0) 推荐(0)
摘要:#include "pch.h" #include #include #include #include using namespace std; const int NUM = 26; const string wordlist[NUM] = { "apiary","beetle","cereal", "danger","ensign","florid","garage","heal... 阅读全文
posted @ 2019-03-03 20:27 Lightmonster 阅读(490) 评论(0) 推荐(0)
摘要://头文件 #pragma once #ifndef SALES_H_ #define SALES_H_ #include <stdexcept> #include <string> class Sales { public: enum { MONTHS = 12 }; class bad_inde 阅读全文
posted @ 2019-03-02 22:11 Lightmonster 阅读(356) 评论(0) 推荐(0)
摘要:12-1 12-2 12-3 #pragma once #ifndef STOCK_H_ #define STOCK_H_ #include <string> using namespace std; class Stock { private: char* company; int shares; 阅读全文
posted @ 2019-03-01 15:42 Lightmonster 阅读(204) 评论(0) 推荐(0)