c - Find longest suffix of string in given array -

-

given string , array of strings find longest suffix of string in array.

for example

string = google.com.tr

array = tr, nic.tr, gov.nic.tr, org.tr, com.tr

returns com.tr

i have tried use binary search specific comparator, failed.

c-code welcome.

edit:

i should have said im looking solution can work can in preparation step (when have array of suffixes, , can sort in every way possible, build data-structure around etc..), , given string find suffix in array fast possible. know can build trie out of array, , give me best performance possible, im lazy , keeping trie in raw c in huge peace of tangled enterprise code no fun @ all. binsearch-like approach welcome.

assuming constant time addressing of characters within strings problem isomorphic finding largest prefix.

  1. let i = 0.

  2. let s = null

  3. let c = prefix[i]

  4. remove strings a a if a[i] != c , if a. replace s a if a.length == + 1.

  5. increment i.

  6. go step 3.

is you're looking for?

example:

prefix = rt.moc.elgoog

array = rt.moc, rt.org, rt.cin.vof, rt.cin, rt

pass 0: prefix[0] 'r' , array[j][0] == 'r' j nothing removed array. i + 1 -> 0 + 1 -> 1 our target length, none of strings have length of 1, s remains null.

pass 1: prefix[1] 't' , array[j][1] == 'r' j nothing removed array. there string has length 2, s becomes rt.

pass 2: prefix[2] '.' , array[j][2] == '.' remaining strings nothing changes.

pass 3: prefix[3] 'm' , array[j][3] != 'm' rt.org, rt.cin.vof, , rt.cin strings removed.

etc.


Comments

Post a Comment

Popular posts from this blog

c++ - Linked List error when inserting for the last time -

-
so have part of code here this loop 5 times (max = 5) insert word link list. for ( int = 0 ; < max ; i++ ) { string alphabet = g->returnalphabets(); l[i]->addwords(alphabet[i]); } and have insert word part here string line; fstream myfile ("words.txt"); while (!myfile.eof()) { getline(myfile,line); if ( alphabet == line[0] ) { listnode *newnode = new listnode; if ( head == null ) { newnode->item = alphabet; newnode->next = null; head = newnode; } else { newnode->item = line; prev = cur; prev->next = newnode; } cur = newnode; } } myfile.close(); my problem gives me error on last loop. meaning on max = 4, insert node. rest of loop fine. when decrease max 4 meaning loop 4 times, program error-free when program loops 5 times gives error. anyone can poin...
Read more

java - activate/deactivate sonar maven plugin by profile? -

-
i use sonar plugin executes if activated in maven profile. sonar runs on every compile. the problem build fail other team members not have sonar application installed locally. pom.xml checked in team members same copy including sonar configuration, don't want them modify purpose of disabling sonar (they might inadvertently check modified copy in). please advise how configure maven (.m2/settings.xml) and/or pom.xml sonar feature can enabled/disabled local profile. here sonar configuration in each project's pom.xml: <plugin> <groupid>org.codehaus.mojo</groupid> <artifactid>sonar-maven-plugin</artifactid> <version>1.0</version> <executions> <execution> <id>make-sonar</id> <phase>compile</phase> <goals> <goal>sonar</goal> </goals> </execution> </executions> ...
Read more

tsql - Pivot with Temp Table (definition for column must include data type) -- SQL Server 2008 -

-
the following returning 2 errors: 'the definition column '0.63' must include data type.' 'the select list insert statement contains fewer items insert list. number of select values must match number of insert columns.' i understand need assign data type columns being inserted temp table don't quite understand how dynamic code however. if explanation on how @cols variable code working , specific issue. fldpk data type int , pivot fields i.e. @cols, float data type. declare @cols nvarchar(max), @query nvarchar(max); select @cols = stuff((select distinct ',' + quotename(fldci) fn_qryt_1() xml path(''), type ).value('.', 'nvarchar(max)') ,1,1,'') set @query = 'select fldpk, ' + @cols + ' ( select fldpk ,fldni ...
Read more