这一题用动态规划的思想解决的,算法时间复杂度和空间复杂度都不太好,不过动态规划的思路基本都是这样的。如果求和最大字数组,同样可以对所有字数组进行叠加判断,不过最好在算法中改进一下,可以减少算法计算量。
package text;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
/**
* PD算法返回数组中所有递增的子数组
* @author chengguotao
*/
public class text3_6 {
public static List LongList(int[] a) {
if (a == null || a.length == 0) {
return null;
}
List<List<Integer>> mapList = new ArrayList<List<Integer>>();
if (a.length > 1) {
int[] b = Arrays.copyOfRange(a, 0, a.length - 1);
int lastIndex;
List<List<Integer>> tempMapList = new ArrayList<List<Integer>>();
mapList = LongList(b);
for (int i = 0; i < mapList.size(); i++) {
List<Integer> listTemp = new ArrayList<Integer>();
lastIndex = mapList.get(i).size() - 1;
if (mapList.get(i).get(lastIndex) < a[a.length - 1]) {
listTemp.addAll(mapList.get(i));
listTemp.add(a[a.length - 1]);
tempMapList.add(listTemp);
}
}
if (tempMapList != null && tempMapList.size() != 0) {
mapList.addAll(tempMapList);
}
List<Integer> list = new ArrayList<Integer>();
list.add(a[a.length - 1]);
mapList.add(list);
return mapList;
} else {
List<Integer> tempList = new ArrayList<Integer>();
tempList.add(a[a.length - 1]);
mapList.add(tempList);
return mapList;
}
}
public static void main(String[] args) {
int[] a = { 7, 0, 8, 1, 2 };
List<List<Integer>> mapList = LongList(a);
List<Integer> tempList = new ArrayList<Integer>();
for (int j = 0; j < mapList.size(); j++) {
if (mapList.get(j).size() > tempList.size())
tempList = mapList.get(j);
}
System.out.print(tempList);
}
}