2017-03-04 95 views
-1

此代码是寻找到一个分隔的文件,并以最小的总面积发现全国各地,我以比较它们提出了两套对字符串的定义。该代码输出为largestCountry功能,而不是最小的国家的信息。smallestCountry功能输入和输出错误

while (!in.fail()) 
{ 
    if (minArea == 0 || Area < minArea) 
    { 
     readRecord(in, ISO2, ISO32, ISONumeric2, fips2, Country2, Capital2, 
      Area2, Population2, Continent2, tld2, CurrencyCode2, CurrencyName2, Phone2, 
      PostalCodeForm2, PostalCodeRegex2, Languages2, geonameid2, neighbors2, 
      EquivalentFipsCode2); 

     minArea = Area2; 
    } 
    else { 
     readRecord(in, ISO, ISO3, ISONumeric, fips, Country, Capital, 
      Area, Population, Continent, tld, CurrencyCode, CurrencyName, Phone, 
      PostalCodeForm, PostalCodeRegex, Languages, geonameid, neighbors, 
      EquivalentFipsCode); 
    } 
} 
+0

如果它不以''<' , put a '> ... – YSC

回答

0

只是猜测,因为我们缺少的信息很多

// some init of Area & minArea here 

while (!in.fail()) { 
    if (Area < minArea) { 
     minArea = Area; 
    } 
    readRecord(in, ISO, ISO3, ISONumeric, fips, Country, Capital, 
     Area, Population, Continent, tld, CurrencyCode, CurrencyName, Phone, 
     PostalCodeForm, PostalCodeRegex, Languages, geonameid, neighbors, 
     EquivalentFipsCode); 

} 
+0

或无条件,'minArea =的std :: min工作(minArea,Area);' – YSC