JAVA EXAMPLE PROGRAMS

JAVA EXAMPLE PROGRAMS

Publish Your Article Here

Program: How to get sub list from ArrayList?


Description:

Here we can see example for getting ArrayList content based on range of index. By specifing the start and end index of the range, you can get the sub-list.


Code:
package com.java2novice.arraylist;

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

public class MyArrayListSubRange {

	public static void main(String a[]){
		ArrayList<String> arrl = new ArrayList<String>();
		//adding elements to the end
		arrl.add("First");
		arrl.add("Second");
		arrl.add("Third");
		arrl.add("Random");
		arrl.add("Click");
		System.out.println("Actual ArrayList:"+arrl);
		List<String> list = arrl.subList(2, 4);
		System.out.println("Sub List: "+list);
	}
}

Output:
Actual ArrayList:[First, Second, Third, Random, Click]
Sub List: [Third, Random]
<< Previous Program | Next Program >>

List Of All ArrayList Sample Programs:

  1. Basic ArrayList Operations.
  2. How to read all elements in ArrayList by using iterator?
  3. How to copy or clone a ArrayList?
  4. How to add all elements of a list to ArrayList?
  5. How to delete all elements from my ArrayList?
  6. How to find does ArrayList contains all list elements or not?
  7. How to copy ArrayList to array?
  8. How to get sub list from ArrayList?
  9. How to sort ArrayList using Comparator?
  10. How to reverse ArrayList content?
  11. How to shuffle elements in ArrayList?
  12. How to swap two elements in a ArrayList?
  13. How to convert list to csv string format?
Knowledge Centre
When to use LinkedList or ArrayList?
Accessing elements are faster with ArrayList, because it is index based. But accessing is difficult with LinkedList. It is slow access. This is to access any element, you need to navigate through the elements one by one. But insertion and deletion is much faster with LinkedList, because if you know the node, just change the pointers before or after nodes. Insertion and deletion is slow with ArrayList, this is because, during these operations ArrayList need to adjust the indexes according to deletion or insetion if you are performing on middle indexes. Means, an ArrayList having 10 elements, if you are inserting at index 5, then you need to shift the indexes above 5 to one more.
Famous Quotations
When I do good, I feel good; when I do bad, I feel bad, and that is my religion.
-- Abraham Lincoln

About Author

I'm Nataraja Gootooru, programmer by profession and passionate about technologies. All examples given here are as simple as possible to help beginners. The source code is compiled and tested in my dev environment.

If you come across any mistakes or bugs, please email me to [email protected].

Most Visited Pages

Other Interesting Sites

Reference: Java™ Platform Standard Ed. 7 - API Specification | Java™ Platform Standard Ed. 8 - API Specification | Java is registered trademark of Oracle.
Privacy Policy | Copyright © 2022 by Nataraja Gootooru. All Rights Reserved.