LONGEST WORD 解题思路 codeEval_longestword-优快云博客

博客探讨了如何解决codeEval上的LONGEST WORD问题，方法与PENULTIMATE WORD相似，主要步骤包括拆分单词并找出最长的单词进行输出。

这一题跟PENULTIMATE WORD是一样的，首先拆词出来，然后找到最长的那个单词输出即可

#include <iostream>
#include <fstream>
#include <vector>
#include <string>
using namespace std;

void split(const string& s, const string& delim, vector<string> &v) {
	if(s.size() == 0) return;
	int last = 0;
	size_t index = s.find_first_of(delim, last);
	while(index != string::npos) {
		v.push_back(s.substr(last, index-last));
		last = index+1;
		index = s.find_first_of(delim, last);
	}
	if(index - last > 0)
		v.push_back(s.substr(last, index-last));
}

int main (int argc, char* argv[]) 
{
	ifstream file;
	string lineBuffer;

	file.open(argv[1]);
	while (!file.eof()) {
		getline(file, lineBuffer);
		if (lineBuffer.length() == 0)
			continue; //ignore all empty lines
		else {
			vector<string> v;
			unsigned int maxIndex = 0, maxLen = 0;
			split(lineBuffer, " ", v);
			for(int i=0; i<(int)v.size(); i++) {
				if(v[i].length() > maxLen) {
					maxIndex = i;
					maxLen = v[i].length();
				}
			}
			cout << v[maxIndex] << endl;
		}
	}
	return 0;
}