向量应用.cpp

数据结构常用算法——向量应用。希望能给读者朋友带来帮助。

#include<iostream.h>
#include"Sstring.h"
#include"Vector.h"
void wordLengthFreg(Vector<int> & counts){
	const int Lengthmax=counts.length();
	int len;
	String word;
	cin>>word;
	while(word[0]!='N'&&word[0]!='n'){
		if((len=word.StrLength())<Lengthmax)
			counts[len]=counts[len]+1;
		else
			counts[0]=counts[0]+1;
		cin>>word;
	}
}
void main(){
	Vector<int>Vector1(10,0);
	wordLengthFreg(Vector1);
	cout<<"Here is Vector1:"<<endl;
	cout<<Vector1;
}