zoukankan      html  css  js  c++  java
  • HDU 2585 Hotel(字符串的模糊匹配+递归)

    Problem Description
    Last year summer Max traveled to California for his vacation. He had a great time there: took many photos, visited famous universities, enjoyed beautiful beaches and tasted various delicious foods. It is such a good trip that Max plans to travel there one more time this year. Max is satisfied with the accommodation of the hotel he booked last year but he lost the card of that hotel and can not remember quite clearly what its name is. So Max searched 
    in the web for the information of hotels in California ans got piles of choice. Could you help Max pick out those that might be the right hotel?
     
    Input
    Input may consist of several test data sets. For each data set, it can be format as below: For the first line, there is one string consisting of '*','?'and 'a'-'z'characters.This string represents the hotel name that Max can remember.The '*'and '?'is wildcard characters. '*' matches zero or more lowercase character (s),and '?'matches only one lowercase character.

    In the next line there is one integer n(1<=n<=300)representing the number of hotel Max found ,and then n lines follow.Each line contains one string of lowercase character(s),the name of the hotel.
    The length of every string doesn't exceed 50.
     
    Output
    For each test set. just simply one integer in a line telling the number of hotel in the list whose matches the one Max remembered.
     
    Sample Input
    herbert
    2
    amazon
    herbert
     
    ?ert*
    2
    amazon
    herbert
     
     
    *
    2
    amazon
    anything
     
    herbert?
    2
    amazon
    herber
     
    Sample Output
    1
    0
    2
    0
     
    字符串的模糊匹配,?可以当做都匹配的一个字符,遇到*时自带一个查找
     
     1 #include <iostream>
     2 #include<cstdio>
     3 #include<cmath>
     4 #include<cstring>
     5 #include<string>
     6 
     7 using namespace std;
     8 
     9 char a[55],b[55];
    10 int n,len1,len2,res;
    11 
    12 bool digital(int i,int j)
    13 {
    14     //结尾判定
    15     if(i==len1&&j==len2)
    16         return true;
    17     else if(i==len1||j==len2)
    18         return false;
    19     //中间过程
    20     else if(a[i]=='*')
    21     {
    22         for(int k=j;k<=len2;k++)
    23             if(digital(i+1,k))
    24             return true;
    25     }
    26     else if(a[i]=='?'||a[i]==b[j])
    27         digital(i+1,j+1);
    28     else
    29         return false;
    30 }
    31 
    32 int main()
    33 {
    34     while(scanf("%s",&a)!=EOF)
    35     {
    36         scanf("%d
    ",&n);
    37         len1=strlen(a);
    38         res=0;
    39         while(n--)
    40         {
    41             scanf("%s",&b);
    42             len2=strlen(b);
    43             if(digital(0,0))
    44                 res++;
    45         }
    46         printf("%d
    ",res);
    47     }
    48     return 0;
    49 }
  • 相关阅读:
    Hello_Area_Description 任务三:Project Tango采集区域描述数据
    智能小车 机器人
    Hello_Depth_Perception 任务二:Project Tango采集深度感知数据
    Project Tango Explorer
    make运行阶段划分
    关于chroot
    xargs命令
    debian配置集锦
    gdb使用技巧
    gdb调试使用autotools工程的项目
  • 原文地址:https://www.cnblogs.com/Annetree/p/7144816.html
Copyright © 2011-2022 走看看