int getMode(int nums[], int n, int* maxCount){
    int i = 0;
    *maxCount = 1;
    int index = 0;
    while(i < n - 1){
        int tempCount = 1;
        int j;
        for(j = i; j < n - 1; j++){
            if(nums[j] == nums[j+1]){
                tempCount++;
            }else{
                break;
            }
        }
        if(*maxCount < tempCount){
            *maxCount = tempCount;
            index = j;
        }
        i = ++j;
    }
    return index;
}

int* randomCollection(int n, int max){
    srand(time(0));
    int* coins = new int[n];
    for(int i = 0; i < n; i++){
        coins[i] = rand() % max;
    }
    return coins;
}

void printCollection(int coins[], int n){
    cout << "[";
    for(int i = 0; i < n - 1; i++){
        cout << coins[i] << ",";
    }
    cout << coins[n-1] << "]" << endl;
}

#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;

int main()
{
    int count = 300, max = 500, maxCount = 0;
    int* list = randomCollection(count, max);
    printCollection(list, count);    
    sort(list, list + count);
    printCollection(list, count); 
    cout << "the Mode is:" << list[getMode(list, count, &maxCount)] << ", the Multiplicity is:" << maxCount << endl; 
    return 0;
}

template<class T>
struct Node {
    T data;
    Node* lchild, * rchild;
};

#include <stdio.h>
using namespace std;

bool isEqual(Node<int>* bt1, Node<int>* bt2) {
	if (bt1 == NULL && bt2 == NULL)//正确的出口
		return true;
	else if (bt1 == NULL || bt2 == NULL)
		return false;
	else {
		cout << bt1->data << "," << bt2->data << endl;
		if (bt1->data != bt2->data)
			return false;
		return isEqual(bt1->lchild, bt2->lchild) && isEqual(bt1->rchild, bt2->rchild);
	}
}

//创建二叉树
//根据平衡二叉树规则生成
Node<int>* CreateBTtree(int a[], int n)
{
	Node<int>* root, * c, * pa = NULL, * p;
	int i;
	root = new Node<int>;
	root->data = a[0];
	root->lchild = root->rchild = NULL;
	for (i = 1; i < n; i++)
	{
		p = new Node<int>;
		p->lchild = p->rchild = NULL;
		p->data = a[i];
		c = root;
		while (c)
		{
			pa = c;
			if (c->data < p->data) //根节点小于待插入节点
				c = c->rchild;      //往右遍历
			else                  //根节点大于待插入节点 
				c = c->lchild;      //往左遍历
		}
		if (pa->data < p->data)
			pa->rchild = p;        //右放
		else
			pa->lchild = p;         //左放
	}
	return root;    //返回根节点
}

void test() {
	int a[8] = { 5, 3, 7, 2, 4, 6, 8, 9 };
	int b[8] = { 5, 3, 7, 2, 4, 6, 8, 15 };
	int c[7] = { 5, 3, 7, 2, 4, 6, 8 };
	int d[8] = { 5, 3, 7, 2, 4, 6, 8, 1 };
	Node<int>* bt1 = CreateBTtree(a, 8);
	Node<int>* bt2 = CreateBTtree(a, 8);
	Node<int>* bt3 = CreateBTtree(b, 8);
	Node<int>* bt4 = CreateBTtree(c, 7);
	Node<int>* bt5 = CreateBTtree(d, 8);
	cout << "A and B Equal or Not : " << (isEqual(bt1, bt2) ? "Equal" : "Not Equal") << endl;
	cout << "A and C Equal or Not : " << (isEqual(bt1, bt3) ? "Equal" : "Not Equal") << endl;
	cout << "A and D Equal or Not : " << (isEqual(bt1, bt4) ? "Equal" : "Not Equal") << endl;
	cout << "A and E Equal or Not : " << (isEqual(bt1, bt5) ? "Equal" : "Not Equal") << endl;
}