/*
 * Copyright 2021 - 2022 the original author or authors.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      https://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package org.springframework.sbm.java.impl;

import java.util.Arrays;

public class ArrayUtils {

    public static String[] longestCommonPrefix(String[] p1, String[] p2) {
        int len = Math.min(p1.length, p2.length);
        for (int i = 0; i < len; i++) {
            if (!p1[i].equals(p2[i])) {
                return Arrays.copyOf(p1, i);
            }
        }
        return p1.length < p2.length ? p1 : p2;
    }

}
