1. var longestCommonPrefix = function(strs) {
    2. if (strs.length === 0) return "";
    3. let first = strs[0];
    4. if (first === "") return "";
    5. let minLen = Number.MAX_SAFE_INTEGER;
    6. for (let i = 1; i < strs.length; i++) {
    7. const len = twoStrLongestCommonPrefix(first, strs[i]);
    8. minLen = Math.min(len, minLen);
    9. }
    10. return first.slice(0, minLen);
    11. };
    12. function twoStrLongestCommonPrefix (s, t) {
    13. let i = 0, j = 0;
    14. let cnt = 0;
    15. while (i < s.length && j < t.length) {
    16. console.log(s[i], t[j], cnt)
    17. if (s[i] === t[j]) {
    18. cnt++;
    19. } else {
    20. return cnt;
    21. }
    22. i++;
    23. j++;
    24. }
    25. return cnt;
    26. }