java List<Long[]> 截取

最新推荐文章于 2025-09-23 10:15:58 发布

原创最新推荐文章于 2025-09-23 10:15:58 发布 · 5.7k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#list #java #string #class

Java 专栏收录该内容

84 篇文章

订阅专栏

本文探讨了如何通过优化数据结构和算法来提高程序效率，包括排序算法、动态规划、哈希算法等核心概念的应用与优化策略。

package com.org.ruizi;

import java.util.ArrayList;
import java.util.List;

public class Test {
	public static void main(String[] args) {
		List<Long[]> list = new ArrayList<Long[]>();
		Long[] one1 = new Long[]{1L,2L};
		Long[] one2 = new Long[]{2L,3L};
		Long[] one3 = new Long[]{4L,5L};
		Long[] one4 = new Long[]{5L,6L};
		Long[] one5 = new Long[]{6L,7L};
		Long[] one6 = new Long[]{8L,66L};
		list.add(one1);
		list.add(one2);
		list.add(one3);
		list.add(one4);
		list.add(one5);
		list.add(one6);
		print(say(list));
	}
	
	public static List<Long[]> say(List<Long[]> list)
	{
		for(int i = 0 ; i<list.size()-1 ; i++)
		{
			for(int j = 0 ; j<list.size()-1-i; j++)
			{
				Long[] longOne = list.get(j);
				Long[] longTwo = list.get(j+1);
				Long[] temp = new Long[2];
				if(longOne[1].equals(longTwo[0]))
				{
					temp[0] = longOne[0];
					temp[1] = longTwo[1];
					list.remove(j);
					list.remove(j);
					list.add(j, temp);
				}
			}
		}
		return list;
	}
	
	public static void print(List<Long[]> list){
		for(int i = 0 ; i<list.size(); i++){
			System.out.println(list.get(i)[0]+"\t"+list.get(i)[1]);
		}
	}
}