P1059 明明的随机数:Set巧用等
解法一
特点:不是拿出(同时查重),排序。而是放在坐标轴(完成排序,查重),flag法查重;
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,x,sum=0;
int a[1000],b[1000];
cin>>n;
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
for(int i=0;i<n;i++)
{
cin>>x;
if(a[x])
continue;
a[x]++;
b[i]=x;
sum++;
}
cout<<sum<<endl;
sort(b,b+n);
for(int j=0;j<1000;j++)
{
if(b[j]!=0)
cout<<b[j]<<" ";
}
}
原文链接:https://blog.csdn.net/weixin_43537190/article/details/83962734
解法二:
特点:巧用Set的set的自动去重和自动从小到大排序的特性
#include <bits/stdc++.h>
using namespace std;
set<int> s;
int main()
{
int n;
cin>>n;
while(n--)
{
int x;
cin>>x;
s.insert(x);
}
cout<<s.size()<<endl;
for(auto it=s.begin();it!=s.end();it++)
cout<<*it<<" ";
}
原文链接:https://blog.csdn.net/weixin_43537190/article/details/83962734
解法三:
我的解法:答案正确,可就是!AC 气死了;
特点:用了Vector
package acm;
import java.util.Collections;
import java.util.Scanner;
import java.util.Vector;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc =new Scanner(System.in);
int n=sc.nextInt();
Vector<Integer> arr=new Vector<>();
System.out.println();
for (int i = 0; i < n; i++) {
int a=sc.nextInt();
if(!arr.contains(new Integer(a))){
arr.add(new Integer(a));
}
}
Collections.sort(arr);
System.out.println(arr.size());
for (Integer integer : arr) {
System.out.print(integer.toString()+" ");
}
}
}
关于Vector,collections.soft
对vector的排序有两种,一种是从小到大排序,一种是从大到小排序,sort默认从小到大排序。
public class Main{
static Scanner cin = new Scanner(System.in);
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) throws IOException {
Vector<Integer> vector = new Vector<Integer>();
Random random = new Random();
for(int i = 0; i < 12; i++) {
vector.add(random.nextInt(10));
}
System.out.println(vector);
Collections.sort(vector,Collections.reverseOrder());//逆序
System.out.println(vector);
Collections.sort(vector);
System.out.println(vector);
}
}
原文链接:https://blog.csdn.net/zsgg_acm/article/details/50268277
总结:
1.对java方法掌握少,不熟练,需要多做题;
2.解法三占用的内存比解法二大很多?还是因为题做错了?