Spilt String in 3 non-empty parts such that a + b, b + c and c + a are all different strings

后端 未结 0 1282
迷失自我
迷失自我 2021-01-14 15:29

Given a string s, task is to count the number of ways of splitting s into three non-empty parts a, b and c in such a way that a + b, b + c and c + a are all different string

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