how to replace lastindexof "," to the word "and" but avoid to replace "and" inside the open and close parenthesis in vb.net -


how replace last accurancy "," word "and" avoid replace "and" inside open , close parenthesis in vb.net

sample:

a,a1,a2,a3,b,b1,b2,b3,c,c1,c2,c3

i want output a(a1,a2,a3),b(b1,b2,b3) , c(c1,c2,c3)

this code: dim strng string = me.checkbox1.text

    'now find position of last appearing ","     dim comaposition integer     comaposition = strng.lastindexof(",") 'it 0  based      'if not found, return -1 , u can exit, no need work     if comaposition = "-1"          exit sub     end if      'remove comma     dim string_after_removing_comma string     string_after_removing_comma = strng.remove(comaposition, 1)      'add "and" in same position comma found     dim final_string string     final_string = string_after_removing_comma.insert(comaposition, " , ")      'show on textbox     checkbox1.text = final_string

how can idea

here solution you:

dim test string = "a,a1,a2,a3,b,b1,b2,b3,c,c1,c2,c3"  'this gets a,b,c  dim singlechar string() = test.split(",").where(function(a) not a.any(function(c) char.isdigit(c))).toarray()  'this gets rest of string dim charwithnumbers string() = test.split(",").where(function(a) a.any(function(c) char.isdigit(c))).toarray()  dim strfinal string = ""  dim diction = new dictionary(of string, list(of string))() dim list = new list(of string)()  'this add similar strings found in "charwithnumbers" based on  'the characters in "singlechar" list each c char in singlechar     list = new list(of string)()     diction.add(c, list)     each item string in charwithnumbers         if item.contains(c)             list.add(item)         end if     next next  'grouping list each item  in diction     strfinal += item.key + "(" + string.join(",", item.value) + ")," next  strfinal = strfinal.trimend(","c) 'removes trailing ','  'to replace "," "and" dim lastchar = singlechar(singlechar.count() - 1)  strfinal = strfinal.replace("," + lastchar + "(", " , " + lastchar + "(")  console.writeline(strfinal)

output:

a(a1,a2,a3),b(b1,b2,b3) , c(c1,c2,c3)

this not optimized performance, don't think bother it.

check output in .net fiddle


Comments

Post a Comment

Popular posts from this blog

Sort a complex associative array in PHP -

this question has answer here: php sort array subarray value 5 answers i have associative array in php like: $newarray1 = array ( [producta] => array ( [link] => http://sanjosespartan.com/blog/products/agile-java-development/ [visitcount] => 4 ) [productd] => array ( [link] => http://sanjosespartan.com/blog/products/intro-to-go/ [visitcount] => 1 ) [productg] => array ( [link] => http://sanjosespartan.com/blog/products/node-js-for-developers/ [visitcount] => 1 ) [productb] => array ( [link] => http://sanjosespartan.com/blog/products/beginning-mysql/ [visitcount] => 1 ) [productc] => array ( [link] => http://sanjosespartan.com/blog/products/computer-networks/ [visitcount] => 1 ) ...
Read more

vb.net - How to ignore if a cell is empty nothing -

how use roscolor() ignore value (like empty cell) ? color row if value upper 5 when there nothing in cell, want ignore roscolor() apply, how? public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val integer val = quotedatagridview1.rows(i).cells(3).value if val = vbempty quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white elseif val < 5 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.red elseif val > 5 , val < 10 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.lightyellow end if next end sub you can check empty value following public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val = quotedatagridview1.rows(i).cells(3).value if isdbnull(val) or val nothing quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white ...
Read more

recursion - Can every recursive algorithm be improved with dynamic programming? -

i first year undergraduate csc student looking competitive programming. recursion involves defining , solving sub problems. understand, top down dynamic programming (dp) involves memoizing solutions sub problems reduce time complexity of algorithm. can top down dp used improve efficiency of every recursive algorithm overlapping sub problems? dp fail work , how can identify this? the short answer is: yes. however, there constraints. obvious 1 recursive calls must overlap. i.e. during execution of algorithm, recursive function must called multiple times same parameters. lets truncate recursion tree memoization. can use memoization reduce number of calls. however, reduction of calls comes price. need store results somewhere. next obvious constraint need have enough memory. comes not-so obvious constraint. memory access requires time. first need find result stored , maybe copy location. in cases, might faster let recursion calculate result instead of loading somewher...
Read more