回文序列

 1 import java.util.LinkedList;
 2 import java.util.Scanner;
 3 
 4 /**
 5  * 回文数 求 最少操作步数
 6  * 从两边对比 不行等和里边的数操作替换，相等就过 继续比较里边的数  直到 i 过半 
 7  * @author Dell
 8  *
 9  */
10 public class Main {
11     
12 public static void main(String[] args) {
13     Scanner sc = new Scanner(System.in);
14     int n = sc.nextInt();
15     LinkedList<Integer> list = new LinkedList<Integer>();
16     for (int i = 0; i < n; i++) {
17         list.add(sc.nextInt());
18     }
19     int step = 0;
20     int i =0; 
21     while(i<=(list.size()/2)) {
22         int j = list.size()-1-i;
23         if (list.get(i)<list.get(j)) {
24             list.set(i,list.get(i)+list.get(i+1));
25             list.remove(i+1);
26             step++;
27         }else if (list.get(i)>list.get(j)) {
28             list.set(j,list.get(j)+list.get(j-1));
29             list.remove(j-1);
30             step++;
31         }else {
32             i++;
33         }
34     }
35     System.out.println(step);
36 }
37 }