符文储备

import java.util.Arrays;

/**
 * The main idea is to use Java Streams to sort the runes and then find the longest subarray where
 * the difference between any two consecutive elements is at most 1.
 */
public class RuneExpeditionStream {
    public int maxRunes(int[] runes) {
        int[] sortedRunes = Arrays.stream(runes).sorted().toArray(); // Sort the runes array using streams
        int maxCount = 1; // Initialize maxCount
        int currentCount = 1; // Initialize currentCount

        for (int i = 1; i < sortedRunes.length; i++) {
            if (sortedRunes[i] - sortedRunes[i - 1] <= 1) { // Check if the current rune and the previous rune difference is at most 1
                currentCount++; // Increment current count
                maxCount = Math.max(maxCount, currentCount); // Update max count if needed
            } else {
                currentCount = 1; // Reset current count
            }
        }

        return maxCount; // Return the maximum number of runes that can be carried
    }

    public static void main(String[] args) {
        RuneExpeditionStream re = new RuneExpeditionStream();
        int[] runes1 = {1, 3, 5, 4, 1, 7};
        int[] runes2 = {1, 1, 3, 3, 2, 4};
        System.out.println(re.maxRunes(runes1)); // Output: 3
        System.out.println(re.maxRunes(runes2)); // Output: 6
    }
}