马上要参加IEEE编程比赛了,找两道简单的题目练习一下。
首先贴上自己写的代码:
#include <iostream>
#include <string>
#include <vector>
#include <fstream>
using namespace std;
#include <stdlib.h>
#include <algorithm>
int find_position(vector<char>& alpha, char target) {
int nPosition=0;
vector <char>::iterator iElement = find(alpha.begin(),
alpha.end(),target);
if (iElement != alpha.end())
{
nPosition = distance(alpha.begin(), iElement);
}
return nPosition;
}
void compare_string(string& a, int len_a, string& b, int len_b, vector<char>& alpha) {
int length = len_a > len_b ? len_b:len_a;
for (int i = 0; i < length; i++) {
if (find_position(alpha,a[i]) > find_position(alpha,b[i])) {
string temp = a;
a = b;
b = temp;
return;
}
else if (find_position(alpha, a[i]) < find_position(alpha, b[i])) {
return;
}
}
if(len_a <= len_b){
return;
}
else{
string temp = a;
a = b;
b = temp;
return;
}
}
int main(int argc, char* argv[])
{
vector<char>alpha;
string alpha_str;
cin>>alpha_str;
string temp=alpha_str;
for(unsigned i=0;i<temp.size();i++){
temp[i]-=32;
}
alpha_str+=temp;
int N;
cin>>N;
for (unsigned i = 0; i < alpha_str.size(); i++) {
alpha.push_back(alpha_str[i]);
}
vector<string>example(N);
for (int i = 0; i < N; i++) {
cin>> example[i];
}
for (unsigned i = 0; i < example.size(); i++)
{
for (unsigned j = example.size() - 2; j >= i; j--)
{
compare_string(example[j], example[j].size(),example[j + 1], example[j+1].size(),alpha);
if(j==0) break;
}
}
for (unsigned i = 0; i < example.size(); i++) {
cout << example[i]<<endl;
}
return 0;
}
改来改去通过率也只有百分之七十,因为用的是冒泡排序,时间复杂度较高,有百分之三十的用例是超时的。在我修改的过程中一个叫Nickel的哥们用C++提交了一版感觉挺不错的,下面是他的代码:
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
using namespace std;
map<char, int> m;
bool compare(const string& s1, const string& s2){
int len = s1.length() > s2.length() ? s2.length() : s1.length();
for(int i=0; i<len; i++){
char ch1 = s1[i];
char ch2 = s2[i];
if((islower(ch1) && islower(ch2)) || (isupper(ch1) && isupper(ch2))){
if(m[tolower(ch1)] == m[tolower(ch2)]){
continue;
} else{
return m[tolower(ch1)] < m[tolower(ch2)];
}
} else if(isupper(ch1)){
return false;
} else {
return true;
}
}
return s1.length() < s2.length();
}
int main() {
string s;
int N;
cin >> s;
cin >> N;
for(int i=0; i<s.length(); i++){
m[s[i]] = i;
}
vector<string> l(N);
for(int i=0; i<N; i++){
cin >> l[i];
}
sort(l.begin(), l.end(), compare);
for(string s : l){
cout << s << endl;
}
return 0;
}
对比感觉自己的思维方式,编程技巧和一些常用的函数都很欠缺。
这次比赛也不指望得奖,自己还是有自知之明的,只希望能够借这个机会长长见识,养成刷题和做记录的好习惯。