标签: c++ recursion
我需要找到给定数组中最低和的子串,即{2, -3 , -5 ,6,7,}给出-8添加粗体数字。我找到了一种递归检索和的方法,但所有程序都检索总和而不是索引
1. abc // present and also ascending 2. xyz 3. aac // now left ones not present and also ascending 4. bcd