1092 To Buy or Not to Buy
题目大意： 看第一个串是否包含第二个串所有的字母，如果是输出yes然后输出第一个多余字符的数量，否则输出no和缺少字符的数量。 解题思路： 字符串长度范围可以暴力，逐位查找并标记即可。 代码如下： #include<iostream>
#include<cstdio>
#include<fstream>
#include<set>
#include<cmath>
#include<cstring>
相关文章
- 1. 1092 To Buy or Not to Buy （20 point(s)）
- 2. PAT 1092. To Buy or Not to Buy (20)
- 3. PAT1092 To Buy or Not to Buy （20 分）
- 4. PAT (Advanced Level) Practice — 1092 To Buy or Not to Buy （20 分）
- 5. pat顶级1004 To Buy or Not to Buy - Hard Version （35 point(s)）
- 6. PAT (Advanced Level) Practice 1092 To Buy or Not to Buy (map应用于字符串字符个数的统计）
- 7. PAT (Top Level) Practice 1004 To Buy or Not to Buy - Hard Version(深搜枚举+众多剪枝）
- 8. Best Time to Buy and Sell Stock
- 9. best-time-to-buy-and-sell-stock
- 10. Leetcode:Best Time to Buy and Sell Stock
- 更多相关文章...
- • SQL NOT NULL 约束 - SQL 教程
- • MySQL非空约束（NOT NULL） - MySQL教程
- • 算法总结-股票买卖
- • Kotlin学习（二）基本类型
相关标签/搜索
每日一句
-
每一个你不满意的现在，都有一个你没有努力的曾经。
欢迎关注本站公众号,获取更多信息
相关文章
- 1. 1092 To Buy or Not to Buy （20 point(s)）
- 2. PAT 1092. To Buy or Not to Buy (20)
- 3. PAT1092 To Buy or Not to Buy （20 分）
- 4. PAT (Advanced Level) Practice — 1092 To Buy or Not to Buy （20 分）
- 5. pat顶级1004 To Buy or Not to Buy - Hard Version （35 point(s)）
- 6. PAT (Advanced Level) Practice 1092 To Buy or Not to Buy (map应用于字符串字符个数的统计）
- 7. PAT (Top Level) Practice 1004 To Buy or Not to Buy - Hard Version(深搜枚举+众多剪枝）
- 8. Best Time to Buy and Sell Stock
- 9. best-time-to-buy-and-sell-stock
- 10. Leetcode:Best Time to Buy and Sell Stock