Simple match for String Matching

Source: Internet
Author: User
1 # include <iostream> 2 # include <cstdio> 3 # include <string> 4 using namespace STD; 5 Int index (char * a, char * B) 6 {7 int n = 0; // The parent string offset, initially 0 8 while (A [n]! = '\ 0') 9 {10 int M = N; 11 int K; // substring offset 12 for (k = 0; B [k]! = '\ 0'; k ++) 13 {14 if (a [M ++]! = B [k]) // mismatch. Immediately stop 15 {16 break; 17} 18} 19 if (B [k] = '\ 0 ') // match successful 20 {21 return N; 22} 23 n ++; // parent string, starting to move 24} 25 return-1; 26} 27 int main () 28 {29 char * A = "abcdef"; 30 char * B = "cdef"; 31 cout <index (a, B) <Endl; 32}
View code

 

Simple match for String Matching

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.