HDU 6019 MG loves gold

题目地址：http://acm.hdu.edu.cn/showproblem.php?pid=6019

思路：暴力直接超时，后来改为用set存，这样判断之前是否有和当前相同的金克拉会快一点

AC代码：

#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <set>
using namespace std;
set<int> s;
int main()
{
    int t,n,temp;
    scanf("%d",&t);
    while(t--)
    {
        s.clear();
        int sum = 1;
        scanf("%d",&n);
        for(int i=0; i<n; i++)
        {
            scanf("%d",&temp);
            if(s.count(temp))
            {
                sum++;
                s.clear();
            }
            s.insert(temp);
        }
        printf("%d\n",sum);
    }
    return 0;
}

超时代码：

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		int[] visit = new int[100010];
		int[] num = new int[100010];
		Scanner in = new Scanner(System.in);
		int t = in.nextInt();
		while (t-- > 0) {
			int n = in.nextInt();
			for (int i=0; i<n; i++) {
				num[i] = in.nextInt();
			}
			//最开始用一个铲子
			int sum = 1;
			int k = 1;
			visit[0] = num[0];
			for (int i=1; i<n; i++) {
				int j;
				for (j=0; j<k; j++) {
					if (num[i] == visit[j]) {
						sum++;
						visit[0] = num[i];
						k = 1;
						break;
					}
				}
				if (j == k) {
					visit[k++] = num[i];
				}
			}
			System.out.println(sum);
		}
	}

}