PAT Advanced 1048 Find Coins (25) [Hash散列]
题目
Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds of coins as payments. However, there was a special requirement of the payment: for each bill, she could only use exactly two coins to pay the exact amount. Since she has as many as 10^5 coins with her, she definitely needs your help. You are supposed to tell her, for any given amount of money, whether or not she can find two coins to pay for it.
Input Specification:
Each input file contains one test case. For each case, the first line contains 2 positive numbers: N (<=10^5,the total number of coins) and M(<=10^3, the amount of money Eva has to pay). The second line contains N face values of the coins, which are all positive numbers no more than 500. All the numbers in a line are separated by a space.
Output Specification:
For each test case, print in one line the two face values V1 and V2 (separated by a space) such that V1 + V2 = M and V1 <= V2. If such a solution is not unique, output the one with the smallest V1. If there is no solution, output “No Solution” instead.
Sample Input 1:
8 15
1 2 8 7 2 4 11 15
Sample Output 1:
4 11
Sample Input 2:
7 14
1 8 7 2 4 11 15
Sample Output 2:
No Solution
题目分析
每笔交易只能使用两枚硬币交易,已知一些硬币面值,挑选两枚硬币V1,V2进行支付,要求满足两个条件必须V1+V2=M(交易金额),V1<=V2,如果可以找到V1,V2,打印;否则,打印"No Solution"
解题思路
思路 01 (最优、hash)
查找M-coins[i]时间复杂度为O(1)
- int ts[1001],保存输入硬币面值出现次数
- int coins[N],保存输入硬币
- 输入时,统计面值出现次数记录在ts中
- sort(对coins进行升序排序)
- 遍历输入硬币,判断 M-当前硬币面值 的面值是否在输入的硬币中出现过
- 如果coins[i]==M-coins[i],M-coins[i]面值最少出现两次
- 如果coins[i]<M-coins[i],M-coins[i]面值最少出现一次
- 如果coins[i]>M-coins[i],不满足条件A1<=A2
思路 02(二分查找,可对比思路01)
查找M-coins[i]时间复杂度为O(logn)
- 对输入的硬币,进行排序sort(对coins进行升序排序)
- 遍历coins[i],并使用二分思想查找M-coins[i]是否在数组的i+1到N-1位置,如果有打印,否则跳过继续寻找M-coins[i+1]
易错点
- A1<=A2(自己bug)
- ts大小设置应为1001,而不是501(题目已知:1<面值<=500,但是0<M<=1000),因为ts记录的是面值,所以可能搜索最大面值M=999(M=1000,v1=1)出现次数的情况,若ts大小设置为500,将会下标将会越界。(自己bug)
Code
Code 01(最优、hash)
#include <iostream>
#include <algorithm>
using namespace std;
int main(int argc,char * argv[]) {
int N,M;
scanf("%d %d",&N,&M);
int coins[N]= {0};
int values[1001]= {0};
for(int i=0; i<N; i++) {
scanf("%d",&coins[i]);
values[coins[i]]++;
}
sort(coins,coins+N);
int i;
for(i=0; i<N; i++) {
if((coins[i]==M-coins[i]&&values[coins[i]]>=2)
||(coins[i]<M-coins[i]&&values[M-coins[i]]>=1)) { //!= 第二个点错误
printf("%d %d", coins[i], M-coins[i]);
break;
}
}
if(i==N)printf("No Solution");
return 0;
}
Code 02(非最优不推荐、二分查找)
#include <iostream>
#include <algorithm>
using namespace std;
int main(int argc, char * argv[]) {
int N,M;
scanf("%d %d", &N,&M);
int coins[N]= {0};
for(int i=0; i<N; i++) {
scanf("%d",&coins[i]);
}
sort(coins,coins+N);
bool flag = false;
for(int i=0; i<N; i++) {
//二分查找是否存在 M-coins[i];
int left = i+1,right=N-1;
int mid = left+((right-left)>>1);
while(left<=right) {
mid = left+((right-left)>>1);
if(coins[mid]==M-coins[i]) {
break;
} else if(coins[mid]>M-coins[i]) {
right = mid-1;
} else {
left = mid+1;
}
}
if(left>right)continue; //没有找到 M-coins[i];
else { //已找到 M-coins[i],打印,并退出(因为按照coins[i]升序顺序查找,所以第一次找到的就是最小值)
printf("%d %d",coins[i],coins[mid]);
flag = true;
break;
}
}
if(!flag)printf("No Solution");
return 0;
}
PAT Advanced 1048 Find Coins (25) [Hash散列]的更多相关文章
- PAT Advanced 1134 Vertex Cover (25) [hash散列]
题目 A vertex cover of a graph is a set of vertices such that each edge of the graph is incident to at ...
- PAT Advanced 1048 Find Coins (25 分)
Eva loves to collect coins from all over the universe, including some other planets like Mars. One d ...
- PAT Advanced 1084 Broken Keyboard (20) [Hash散列]
题目 On a broken keyboard, some of the keys are worn out. So when you type some sentences, the charact ...
- PAT Advanced 1050 String Subtraction (20) [Hash散列]
题目 Given two strings S1 and S2, S = S1 – S2 is defined to be the remaining string afer taking all th ...
- PAT Advanced 1041 Be Unique (20) [Hash散列]
题目 Being unique is so important to people on Mars that even their lottery is designed in a unique wa ...
- PAT甲 1048. Find Coins (25) 2016-09-09 23:15 29人阅读 评论(0) 收藏
1048. Find Coins (25) 时间限制 50 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Eva loves t ...
- PAT 甲级 1048 Find Coins (25 分)(较简单,开个数组记录一下即可)
1048 Find Coins (25 分) Eva loves to collect coins from all over the universe, including some other ...
- PAT甲题题解-1078. Hashing (25)-hash散列
二次方探测解决冲突一开始理解错了,难怪一直WA.先寻找key%TSize的index处,如果冲突,那么依此寻找(key+j*j)%TSize的位置,j=1~TSize-1如果都没有空位,则输出'-' ...
- PAT Basic 1047 编程团体赛(20) [Hash散列]
题目 编程团体赛的规则为:每个参赛队由若⼲队员组成:所有队员独⽴⽐赛:参赛队的成绩为所有队员的成绩和:成绩最⾼的队获胜.现给定所有队员的⽐赛成绩,请你编写程序找出冠军队. 输⼊格式: 输⼊第⼀⾏给出⼀ ...
随机推荐
- 109-PHP类成员初始化值
<?php class mao{ //定义猫类 public $age=0; //定义多个属性并初始化 public $weight=50; public $color='white'; } $ ...
- centos下将系统预置yum源更换为阿里云源
参考:http://mirrors.aliyun.com/help/centos?spm=5176.bbsr150321.0.0.d6ykiD 步骤1:备份/etc/yum.repos.d/下的Cen ...
- jenkins 最新版 搭建
jenkins 中文网:https://jenkins.io/zh/ 点击下载:https://jenkins.io/zh/download/ 然后选择对应的安装环境,我的CentOS 7.6: 有外 ...
- Spring Cloud Alibaba:Sentinel实现熔断与限流
一.什么是Sentinel Sentinel,中文翻译为哨兵,是为微服务提供流量控制.熔断降级的功能,它和Hystrix提供的功能一样,可以有效的解决微服务调用产生的“雪崩效应”,为微服务系统提供了稳 ...
- 框架基础学习之--详解web+maven+spring+mybatis+struts框架文件夹作用
详解web+maven+spring+mybatis+struts框架文件夹作用 1.程序名 2.Mybatis,mybatis是数据持久层,就是和对象类有关系的东西 3.存放java文件,xml,p ...
- spring源码 ConfigurableListableBeanFactory根接口
用机器翻译+原作者的翻译:https://blog.csdn.net/u011179993/article/details/51636742 /* * Copyright 2002-2015 the ...
- POJ 3615 Cow Hurdles(最短路径flyod)
Cow Hurdles Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9337 Accepted: 4058 Descr ...
- 用cat写入
$ cat >> gzip_work.sh <<EOF > mkdir gzip/workshell > EOF
- POJ 3295:Tautology
Tautology Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10482 Accepted: 3982 Descri ...
- zookeeper 安装及集群
一.zookeeper介绍 zookeeper是一个中间件,为分布式系统提供协调服务,可以为大数据服务,也可以为java服务. 分布式系统,很多计算机组成一个整体,作为一个整体一致对外并处理同一请求, ...