Python•longest-common-prefix/synced-solution.py
class Solution:
def longestCommonPrefix(self, strs: List[str]) -> str:
if not strs: return class="syntax-string">""
prefix = strs[class="syntax-number">0]
for s in strs[class="syntax-number">1:]:
while not s.startswith(prefix):
prefix = prefix[:-class="syntax-number">1]
if not prefix: return class="syntax-string">""
return prefix
C++•longest-common-prefix/synced-solution.cpp
class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
if (strs.empty()) return class="syntax-string">"";
string prefix = strs[class="syntax-number">0];
for (auto& s : strs) {
while (s.find(prefix) != class="syntax-number">0) {
prefix = prefix.substr(class="syntax-number">0, prefix.size()-class="syntax-number">1);
if (prefix.empty()) return class="syntax-string">"";
}
}
return prefix;
}
};
TypeScript•longest-common-prefix/synced-solution.ts
function longestCommonPrefix(strs: string[]): string {
if (!strs.length) return class="syntax-string">"";
let prefix = strs[class="syntax-number">0];
for (const s of strs) {
while (!s.startsWith(prefix)) {
prefix = prefix.slice(class="syntax-number">0, -class="syntax-number">1);
if (!prefix) return class="syntax-string">"";
}
}
return prefix;
}