JS-snippets-Algorigthms/longestCommonPrefix.js at master · problemsolver03/JS-snippets-Algorigthms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
// var longestCommonPrefix = function (strs) {
//   let prefix = "";
//   let firstChar = strs[0][0];
//   let match = 0;

//   if (strs.length < 2) {
//     return strs[0];
//   }

//   for (let i = 0; i < strs.length; i++) {
//     for (let j = 0; j <= strs.length; j++) {
//       if (strs[i][j] === strs[i][i]) {
//         console.log(strs[i][j], firstChar);
//         match++;
//       }
//       if (match === strs.length - 1) {
//         prefix += strs[i][j];
//         firstChar = strs[0][prefix.length];
//         match = 0;
//       }
//     }
//   }

//   return prefix;
// };

// console.log(longestCommonPrefix(["flo", "flwe"]));

// output is fl;

// iterate to the first string and compare each character of the string with all other SVGStringList;

// if the character matches is all strings add it to retun output.SVGStringList

var longestCommonPrefix = function (strs) {
  let firstword = strs[0];
  let prefix = "";
  let length = firstword.length < 2 ? 2 : firstword.length + 1;
  for (let i = 0; i < length - 1; i++) {
    let firstChar = firstword[i];

    for (let j = 0; j < strs.length; j++) {
      console.log(j);
      if (firstChar === strs[i + 1][j]) {
        prefix += strs[i][j];
      }
    }
  }
  return prefix;
};

console.log(longestCommonPrefix(["low", "lo", "lo"]));