返回介绍

solution / 1900-1999 / 1951.All the Pairs With the Maximum Number of Common Followers / README_EN

发布于 2024-06-17 01:03:12 字数 3029 浏览 0 评论 0 收藏 0

1951. All the Pairs With the Maximum Number of Common Followers

中文文档

Description

Table: Relations

+-------------+------+
| Column Name | Type |
+-------------+------+
| user_id   | int  |
| follower_id | int  |
+-------------+------+
(user_id, follower_id) is the primary key (combination of columns with unique values) for this table.
Each row of this table indicates that the user with ID follower_id is following the user with ID user_id.

 

Write a solution to find all the pairs of users with the maximum number of common followers. In other words, if the maximum number of common followers between any two users is maxCommon, then you have to return all pairs of users that have maxCommon common followers.

The result table should contain the pairs user1_id and user2_id where user1_id < user2_id.

Return the result table in any order.

The result format is in the following example.

 

Example 1:

Input: 
Relations table:
+---------+-------------+
| user_id | follower_id |
+---------+-------------+
| 1     | 3       |
| 2     | 3       |
| 7     | 3       |
| 1     | 4       |
| 2     | 4       |
| 7     | 4       |
| 1     | 5       |
| 2     | 6       |
| 7     | 5       |
+---------+-------------+
Output: 
+----------+----------+
| user1_id | user2_id |
+----------+----------+
| 1    | 7    |
+----------+----------+
Explanation: 
Users 1 and 2 have two common followers (3 and 4).
Users 1 and 7 have three common followers (3, 4, and 5).
Users 2 and 7 have two common followers (3 and 4).
Since the maximum number of common followers between any two users is 3, we return all pairs of users with three common followers, which is only the pair (1, 7). We return the pair as (1, 7), not as (7, 1).
Note that we do not have any information about the users that follow users 3, 4, and 5, so we consider them to have 0 followers.

Solutions

Solution 1

# Write your MySQL query statement below
WITH
  t AS (
    SELECT
      r1.user_id AS user1_id,
      r2.user_id AS user2_id,
      RANK() OVER (ORDER BY COUNT(1) DESC) AS rk
    FROM
      Relations AS r1
      JOIN Relations AS r2 ON r1.follower_id = r2.follower_id AND r1.user_id < r2.user_id
    GROUP BY r1.user_id, r2.user_id
  )
SELECT
  user1_id,
  user2_id
FROM t
WHERE rk = 1;

如果你对这篇内容有疑问,欢迎到本站社区发帖提问 参与讨论,获取更多帮助,或者扫码二维码加入 Web 技术交流群。

扫码二维码加入Web技术交流群

发布评论

需要 登录 才能够评论, 你可以免费 注册 一个本站的账号。
列表为空,暂无数据
    我们使用 Cookies 和其他技术来定制您的体验包括您的登录状态等。通过阅读我们的 隐私政策 了解更多相关信息。 单击 接受 或继续使用网站,即表示您同意使用 Cookies 和您的相关数据。
    原文