1002：487-3279

最新推荐文章于 2021-03-21 12:16:23 发布

圆滚滚的柴柴

最新推荐文章于 2021-03-21 12:16:23 发布

阅读量175

点赞数

分类专栏：北大poj

本文链接：https://blog.csdn.net/zhang_han666/article/details/79265885

版权

北大poj 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

第一次写的代码，wa，个人认为是当测试数据很大时有问题：

#include"iostream"
#include"string"
#include "iomanip"
#include "algorithm"
using namespace std;

struct my_string
{
    string s;
    int n;
};


bool cmp(my_string a, my_string b)
{
    int tmp = a.s.compare(b.s);
    return tmp < 0;
}
int main()
{
    int n;
    my_string s[100003];
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> s[i].s;
        s[i].n = 1;
    }

    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < s[i].s.length(); j++)
        {
            if (!((('0' <= s[i].s.at(j)) && (s[i].s.at(j) <= '9')) ||
                (('A' <= s[i].s.at(j)) && (s[i].s.at(j) <= 'Z'))))
            {
                s[i].s.erase(j, 1);
                continue;
            }
        }
        for (string::iterator j = s[i].s.begin(); j != s[i].s.end(); j++)
        {
            if (('0' <= (*j) && (*j) <= '9'))
            {
                continue;
            }
            if ((*j) == 'A' || (*j) == 'B' || (*j) == 'C')
            {
                (*j) = '2';
                continue;
            }

            if ((*j) == 'D' || (*j) == 'E' || (*j) == 'F')
            {
                (*j) = '3';
                continue;
            }
            if ((*j) == 'G' || (*j) == 'H' || (*j) == 'I')
            {
                (*j) = '4';
                continue;
            }
            if ((*j) == 'J' || (*j) == 'K' || (*j) == 'L')
            {
                (*j) = '5';
                continue;
            }
            if ((*j) == 'M' || (*j) == 'N' || (*j) == 'O')
            {
                (*j) = '6';
                continue;
            }
            if ((*j) == 'P' || (*j) == 'R' || (*j) == 'S')
            {
                (*j) = '7';
                continue;
            }
            if ((*j) == 'T' || (*j) == 'U' || (*j) == 'V')
            {
                (*j) = '8';
                continue;
            }
            if ((*j) == 'W' || (*j) == 'X' || (*j) == 'Y')
            {
                (*j) = '9';
                continue;
            }
        }
    }
    sort(s, s + n, cmp);
    bool flag = false;//是否有相同
    for (int i = 0; i < n; i++)
    {
        if (s[i].n == 0)
        {
            continue;
        }
        else
        {
            for (int j = i + 1; j < n; j++)
            {
                if (s[i].s == s[j].s)
                {
                    flag = true;
                    s[i].n++;
                    s[j].n = 0;
                }
                else
                {
                    break;
                }
            }
        }

    }

    if (flag)
    {
        for (int i = 0; i < n; i++)
        {
            if ((s[i].n != 0)&& s[i].n != 1)
            {
                s[i].s.insert(3, "-");
                cout << s[i].s << " " << s[i].n << endl;
            }
        }
    }
    else
    {
        cout << "No duplicates." << endl;
    }
    return 0;
}

第二次重写，结果超时，我觉得是if条件语句太多所致：

#include"iostream"
#include"string"
#include "iomanip"
#include "algorithm"
#include<stdio.h>  
#include<stdlib.h> 
using namespace std;

struct my_string
{
    char ch[20];
    int n;
}str[100003];

bool cmp(my_string a, my_string b)
{
    string s1 = a.ch;
    string s2 = b.ch;
    int tmp = s1.compare(s2);
    return tmp < 0;
}
int main()
{
    int n;
    char ch[100003];
    cin >> n;
    //scanf_s("%d", &n);
    getchar();
    for (int i = 0; i < n; i++)
    {
        gets_s(ch);
        str[i].n = 1;
        int k = 0;
        for (int j = 0; j < strlen(ch); j++)
        {
            if (k == 3)
            {
                str[i].ch[k++] = '-';
            }
            if (ch[j] == '-')
            {
                continue;
            }
            if (('0' <= ch[j] && ch[j] <= '9'))
            {
                str[i].ch[k++] = ch[j];
                continue;
            }
            if (('A' <= ch[j] && ch[j] <= 'C'))
            {
                str[i].ch[k++] = '2';
                continue;
            }
            if (('D' <= ch[j] && ch[j] <= 'F'))
            {
                str[i].ch[k++] = '3';
                continue;
            }
            if (('G' <= ch[j] && ch[j] <= 'I'))
            {
                str[i].ch[k++] = '4';
                continue;
            }
            if (('J' <= ch[j] && ch[j] <= 'L'))
            {
                str[i].ch[k++] = '5';
                continue;
            }
            if (('M' <= ch[j] && ch[j] <= 'O'))
            {
                str[i].ch[k++] = '6';
                continue;
            }
            if (ch[j] == 'P' || ch[j] == 'R' || ch[j] == 'S')
            {
                str[i].ch[k++] = '7';
                continue;
            }
            if (('T' <= ch[j] && ch[j] <= 'V'))
            {
                str[i].ch[k++] = '8';
                continue;
            }
            if (('W' <= ch[j] && ch[j] <= 'Y'))
            {
                str[i].ch[k++] = '9';
                continue;
            }
        }
    }
    sort(str, str + n, cmp);
    bool flag = true;
    for (int i = 0; i < n; i++)
    {
        for (int j = i + 1; j < n; j++)
        {
            if (str[j].n!=0)
            {
                if (!strcmp(str[i].ch, str[j].ch))
                {
                    flag = false;
                    str[i].n++;
                    str[j].n = 0;
                }
                else
                {
                    break;
                }
            }
        }

    }
    for (int i = 0; i < n; i++)
    {
        if (str[i].n > 1)
        {
            cout << str[i].ch << " " << str[i].n << endl;
        }
    }
    if (flag)
    {
        printf_s("No duplicates.\n");
        //cout << "No duplicates." << endl;
    }
    return 0;
}

参考网上资料，修改代码如下，结果还是超时：

#include"iostream"
#include"string"
#include "iomanip"
#include "algorithm"
#include<stdio.h>  
#include<stdlib.h> 
using namespace std;

int cmp(const void* a, const void* b)
{
    return (strcmp((char*)a, (char*)b));
}
int main()
{
    int n;
    char m[27] = "22233344455566677778889999";
    char ch[100002][10] = { {0} };
    char c[100000];
    scanf_s("%d", &n);
    getchar();
    for (int i = 0; i < n; i++)
    {
        gets_s(c);
        int k = 0;
        for (int j = 0; j < strlen(c); j++)
        {
            if (k == 3)
            {
                ch[i][k++] = '-';
            }
            if (c[j] == '-')
            {
                continue;
            }
            if (('0' <= c[j] && c[j] <= '9'))
            {
                ch[i][k++] = c[j];
                continue;
            }
            if (('A' <= c[j] && c[j] <= 'Z'))
            {
                ch[i][k++] = m[c[j] - 'A'];
                continue;
            }
        }
    }
    qsort(ch, n,sizeof(ch[0]), cmp);
    bool flag = true;
    for (int i = 0; i < n-1;)
    {
        int count = 1;
        int j;
        for (j = i + 1; j < n; j++)
        {
            if (!strcmp(ch[i], ch[j]))
            {
                count++;
            }
        }
        if (count > 1)
        {
            flag = false;
            cout <<ch[i] << " " << count << endl;
        }
        i += count;
    }
    if (flag)
    {
        printf_s("No duplicates.\n");
    }
    return 0;
}

最后一次修改，将输出做了优化，之前用了嵌套for循环，其实一层循环即可，修改输出部分后，AC，代码如下：

 #include"iostream"
#include"string"
#include "iomanip"
#include "algorithm"
#include<stdio.h>  
#include<stdlib.h> 
using namespace std;

int cmp(const void* a, const void* b)
{
    return (strcmp((char*)a, (char*)b));
}
int main()
{
    int n;
    char m[27] = "22233344455566677778889999";
    char ch[100000][10] = { {0} };
    char c[1000];
    scanf_s("%d", &n);
    getchar();
    for (int i = 0; i < n; i++)
    {
        gets_s(c);
        int k = 0;
        for (int j = 0; j < strlen(c); j++)
        {
            if (k == 3)
            {
                ch[i][k++] = '-';
            }
            if (c[j] == '-')
            {
                continue;
            }
            if (('0' <= c[j] && c[j] <= '9'))
            {
                ch[i][k++] = c[j];
                continue;
            }
            if (('A' <= c[j] && c[j] <= 'Z'))
            {
                ch[i][k++] = m[c[j] - 'A'];
                continue;
            }
        }
    }
    qsort(ch, n, sizeof(ch[0]), cmp);
    bool flag = true;
    int count = 1;
    int i;
    for (i = 1; i < n ;i++)
    {
        if (!strcmp(ch[i], ch[i-1]))
        {
            count++;
            flag = false;
        }
        else
        {
            if (count > 1)
            {

                printf("%s %d\n", ch[i - 1], count);
            }
            count=1;
        }
    }
    if (count > 1)
    {
        printf("%s %d\n", ch[n-1], count);
    }
    if (flag)
    {
        printf_s("No duplicates.\n");
    }
    return 0;
}