题目: 链表L: L1, L2, L3, L4, L5,. .. L9
将链表转化成: L1, L9, L3, L8, L4, L7, L5, L6
使用原地算法。。。
解法1: 使用两个链表,不使用原地算法
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
System.out.println("Input int");
String ints = in.nextLine();
LinkedList<Integer> a = new LinkedList<>();
for(String i:ints.split(",")){
a.add(Integer.parseInt(i));
}
LinkedList<Integer> b = new LinkedList<>();
while(true) {
for(int i=0;i<a.size();i++){
if(b.size()==a.size()){
break;
}
b.add(a.get(i));
if(b.size()==a.size()){
break;
}
b.add(a.get(a.size()-i-1));
}
System.out.println(b);
break;
}
}
解法2: 使用removeLast方法获取链表的末尾数
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
System.out.println("Input int");
String ints = in.nextLine();
LinkedList<Integer> a = new LinkedList<>();
for(String i:ints.split(",")){
a.add(Integer.parseInt(i));
}
int temp=0;
int num=1;
for(int i =0; i<a.size()/2; i++){
temp=a.removeLast();
a.add(i+num,temp);
num++;
}
System.out.println(a);
}