日韩性视频-久久久蜜桃-www中文字幕-在线中文字幕av-亚洲欧美一区二区三区四区-撸久久-香蕉视频一区-久久无码精品丰满人妻-国产高潮av-激情福利社-日韩av网址大全-国产精品久久999-日本五十路在线-性欧美在线-久久99精品波多结衣一区-男女午夜免费视频-黑人极品ⅴideos精品欧美棵-人人妻人人澡人人爽精品欧美一区-日韩一区在线看-欧美a级在线免费观看

歡迎訪問 生活随笔!

生活随笔

當前位置: 首頁 > 编程资源 > 编程问答 >内容正文

编程问答

leetcode 825. Friends Of Appropriate Ages

發布時間:2023/12/20 编程问答 39 豆豆
生活随笔 收集整理的這篇文章主要介紹了 leetcode 825. Friends Of Appropriate Ages 小編覺得挺不錯的,現在分享給大家,幫大家做個參考.

leetcode 825. Friends Of Appropriate Ages


原題地址:https://leetcode.com/problems/friends-of-appropriate-ages/

題目

Some people will make friend requests. The list of their ages is given and ages[i] is the age of the ith person.

Person A will NOT friend request person B (B != A) if any of the following conditions are true:

  • age[B] <= 0.5 age[A] + 7*

  • age[B] > age[A]

  • age[B] > 100 && age[A] < 100

Otherwise, A will friend request B.

Note that if A requests B, B does not necessarily request A. Also, people will not friend request themselves.

How many total friend requests are made?

Example 1: Input: [16,16] Output: 2 Explanation: 2 people friend request each other. Example 2: Input: [16,17,18] Output: 2 Explanation: Friend requests are made 17 -> 16, 18 -> 17. Example 3: Input: [20,30,100,110,120] Output: Explanation: Friend requests are made 110 -> 100, 120 -> 110, 120 -> 100.

Note:

  • 1 <= ages.length <= 20000.
  • 1 <= ages[i] <= 120.

python代碼

class Solution:def numFriendRequests(self, ages):""":type ages: List[int]:rtype: int"""age = collections.Counter(ages)res=0for A in age:for B in age:if A == B:if B<=0.5*A+7 or B>A or (B>100 and A<100): continueres += (age[A] * (age[A]-1))else:if B<=0.5*A+7 or B>A or (B>100 and A<100): continueres += age[A] * age[B]return res

總結

以上是生活随笔為你收集整理的leetcode 825. Friends Of Appropriate Ages的全部內容,希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯,歡迎將生活随笔推薦給好友。