#力扣：14. 最长公共前缀@FDDLC

凡我出品，皆属精品2023-10-08 19:11

一、Java

java 复制代码

class Solution {
    public String longestCommonPrefix(String[] strs) {
        for (int l = 0; ; l++) {
            for (int i = 0; i < strs.length; i++) {
                if (l >= strs[i].length() || strs[i].charAt(l) != strs[0].charAt(l)) return strs[0].substring(0, l);
            }
        }
    }
}

二、C++

cpp 复制代码

#include <string>
#include <vector>

using namespace std;

class Solution {
public:
    string longestCommonPrefix(vector<string> &strs) {
        for (int l = 0;; l++) {
            for (int i = 0; i < strs.size(); i++) {
                if (l >= strs[i].length() || strs[i][l] != strs[0][l]) return strs[0].substr(0, l);
            }
        }
    }
};

三、Python

python 复制代码

from typing import List


class Solution:
    def longestCommonPrefix(self, strs: List[str]) -> str:
        l = 0
        while True:
            for i in range(len(strs)):
                if l >= len(strs[i]) or strs[i][l] != strs[0][l]:
                    return strs[0][0:l]
            l += 1

四、JavaScript

javascript 复制代码

var longestCommonPrefix = function (strs) {
    for (let l = 0; ; l++) {
        for (let i = 0; i < strs.length; i++) {
            if (l >= strs[i].length || strs[i][l] != strs[0][l]) return strs[0].substring(0, l);
        }
    }
};

五、Go

Go 复制代码

package main

func longestCommonPrefix(strs []string) string {
	for l := 0; ; l++ {
		for i := 0; i < len(strs); i++ {
			if l >= len(strs[i]) || strs[i][l] != strs[0][l] {
				return strs[0][0:l]
			}
		}
	}
}