Efficient algorithm to find all possible pairs of characters indexes in a string

后端 未结 0 591
情歌与酒
情歌与酒 2020-11-29 23:23

Suppose I have the string "XMIM_XII:MX". I want to find all possible pairs of I and M (by their indexes) between any two X\'s so that would be

XMIM_X =>

相关标签:
回答
  • 消灭零回复
提交回复
热议问题