Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

版本号排序(2023美团暑期实习一面) #494

Open
mengqiuleo opened this issue Apr 10, 2023 · 2 comments
Open

版本号排序(2023美团暑期实习一面) #494

mengqiuleo opened this issue Apr 10, 2023 · 2 comments

Comments

@mengqiuleo
Copy link

有一组版本号如下['0.1.1', '2.3.3', '0.302.1', '4.2', '4.3.5', '4.3.4.5']。现在需要对其进行排序,排序的结果为 ['4.3.5','4.3.4.5','2.3.3','0.302.1','0.1.1']

@mengqiuleo
Copy link
Author

arr.sort((a, b) => {
  let i = 0;
  const arr1 = a.split(".");
  const arr2 = b.split(".");

  while (true) {
    const s1 = arr1[i];
    const s2 = arr2[i];
    i++;
    if (s1 === undefined || s2 === undefined) {
      return arr2.length - arr1.length;
    }

    if (s1 === s2) continue;

    return s2 - s1;
  }
});
console.log(arr);

@whale2002
Copy link

const versions = ["0.1.1", "2.3.3", "0.302.1", "4.2", "4.3.5", "4.3.4.5"];

versions.sort((a, b) => {
  const arr1 = a.split(".").map(Number);
  const arr2 = b.split(".").map(Number);
  
  const length = arr1.length > arr2.length ? arr1.length : arr2.length;

  for (let i = 0; i < length; i++) {
    const item1 = arr1[i] || 0;
    const item2 = arr2[i] || 0;

    if (item1 === item2) continue;
    return item2 - item1;
  }
});

console.log(versions);

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants