I need help in optimization of an array problem that has been asked in interview last month

前端 未结 0 909
無奈伤痛
無奈伤痛 2021-02-07 01:32

Given 2 arrays a and b find the max value of b[i] + b[j] + b[k] (i !=j != k) , where the following condition is satisfied a[i] > a[j] > a

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