int minVal, occurs = 0;
for(vector<int>::size_type ix = 0; ix != ivec.size(); ++ix)
{
minVal = ivec[0];
if(minVal <= ivec[ix]){
if(minVal == ivec[ix])
++occurs;
}
else {
minVal = ivec[ix];
occurs = 1;
}
}
#include <vector>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int da[8]={2,5,-1,6,-1,4,-1,8};
vector<int> vi(da,da+8);
//只需下面一句就可以了……
int minc=count(vi.begin(),vi.end(),*min_element(vi.begin(),vi.end()));
cout<<"最小值出现了"<<minc<<"次."<<endl;
system("pause");
return 0;
}
#include <vector>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int da[8]={2,5,-1,6,-1,4,-1,8};
vector<int> vi(da,da+8);
//不用count，那就用两句解决……
sort(vi.begin(),vi.end());
int minc = upper_bound(vi.begin(),vi.end(),*vi.begin())-vi.begin();
cout<<"最小值出现了"<<minc<<"次."<<endl;
system("pause");
return 0;
}
int minVal, occurs = 0;
for(vector<int>::size_type ix = 0; ix != ivec.size(); ++ix)
{
minVal = ivec[0];
if(minVal >= ivec[ix])
{
if(minVal == ivec[ix])
++occurs;
}
else
{
minVal = ivec[ix];
occurs = 1;
}
}
int iNumber = 1;
unsigned int iVal = v[0];
for(unsigned int x = 1;x < v.size();++ x){
if(v[x] < iVal){
iNumber = 1;
iVal = v[x];
continue;
}
if(v[x] == iVal)
++ iNumber;
}
cout<<iNumber<<" "<<iVal<<endl;
int main()
{
int a[] = {3, 2, 4, 3, 4, 2, 5, 2, -1};
int min = a[0];
int cnt = 0;
for (int i=1; ; ++i)
{
if (a[i] == -1)
break;
if (a[i] == min)
{
++cnt;
}
else if (a[i] < min)
{
min = a[i];
cnt = 1;
}
else
NULL;
}
cout << "min:" << min << endl;
cout << "cnt" << cnt << endl;
return 0;
}
