Java集合学习疑问：为何调用Arrays/Collections类方法而非实例方法？

Great question—this is a super common point of confusion when getting started with Java collections and arrays, and it all comes down to inheritance behavior and historical design choices in the language. Let’s break this down clearly for both arrays and lists:

1. Arrays: Why Arrays.toString(myArray) instead of myArray.toString()? #

Arrays in Java are technically objects, but they inherit their toString() method straight from the root Object class—they don’t override it to show their actual elements.

If you call myArray.toString() directly, you’ll get a weird string like [I@1b6d3586:

• The [I part means "array of integers" (the type signature)
• The hex value is just the object’s hash code (a reference to its memory address)

This tells you nothing about what’s inside the array.

The Arrays.toString() static method fixes this by:

• Iterating over every element in the array
• Calling toString() on each element individually
• Formatting the result into a human-readable string like [1, 2, 3]

Here’s a quick example to see the difference:

int[] myArray = {1, 2, 3};
System.out.println(myArray.toString()); // Output: [I@1b6d3586
System.out.println(Arrays.toString(myArray)); // Output: [1, 2, 3]

2. Lists: Why Collections.sort(myList) instead of myList.sort()? #

This one has a fun historical backstory:

• Before Java 8 (released in 2014), the List interface didn’t have a built-in sort() method at all. All sorting logic for collections was centralized in the Collections utility class via static methods like Collections.sort().
• Java 8 introduced default methods for interfaces, which let the List interface add a sort(Comparator<? super E>) method later on without breaking existing code.

Today, you can use either approach:

• myList.sort(Comparator.naturalOrder()) (modern, more readable, preferred for new code)
• Collections.sort(myList) (still works perfectly—under the hood, it just calls myList.sort(null) now)

The Collections class exists as a "one-stop shop" for generic collection operations (sorting, shuffling, reversing, etc.) that don’t belong to any single collection type. This follows the DRY (Don’t Repeat Yourself) principle—instead of making every List implementation (like ArrayList, LinkedList) rewrite sorting logic, it’s all centralized in one place.

Quick Recap #

• Arrays need Arrays.toString() because their inherited Object.toString() doesn’t display element contents.
• List sorting has two options now: the modern myList.sort() (Java 8+) and the legacy Collections.sort()—both work, but the former is more intuitive.
• Utility classes like Arrays and Collections exist to group reusable, generic operations that don’t fit neatly into the core object interfaces.

内容的提问来源于stack exchange，提问作者Mert Beşiktepe