825 Limit Time Exceeded

Author: aQua

Algorithms/0825.friends-of-appropriate-ages/README.md

@@ -0,0 +1,50 @@
+# [825. Friends Of Appropriate Ages](https://leetcode.com/problems/friends-of-appropriate-ages/)
+
+## 题目
+
+Some people will make friend requests. Thelist of their ages is given andages[i]is the age of theith 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 ifA requests B, B does not necessarily request A. Also, people will not friend request themselves.
+
+How many total friend requests are made?
+
+Example 1:
+
+```text
+Input: [16,16]
+Output: 2
+Explanation: 2 people friend request each other.
+```
+
+Example 2:
+
+```text
+Input: [16,17,18]
+Output: 2
+Explanation: Friend requests are made 17 -> 16, 18 -> 17.
+```
+
+Example 3:
+
+```text
+Input: [20,30,100,110,120]
+Output:
+Explanation: Friend requests are made 110 -> 100, 120 -> 110, 120 -> 100.
+```
+
+Notes:
+
+1. 1 <= ages.length<= 20000.
+1. 1 <= ages[i] <= 120.
+
+## 解题思路
+
+见程序注释

Algorithms/0825.friends-of-appropriate-ages/friends-of-appropriate-ages.go

@@ -0,0 +1,24 @@
+package problem0825
+
+func numFriendRequests(ages []int) int {
+	size := len(ages)
+	res := 0
+	for i := 0; i < size; i++ {
+		for j := 0; j < size; j++ {
+			if i == j || isNotRequest(ages[i], ages[j]) {
+				continue
+			}
+			res++
+		}
+	}
+	return res
+}
+
+func isNotRequest(a, b int) bool {
+	if b <= a/2+7 ||
+		b > a ||
+		(b > 100 && a < 100) {
+		return true
+	}
+	return false
+}

Algorithms/0825.friends-of-appropriate-ages/friends-of-appropriate-ages_test.go

@@ -53,7 +53,9 @@ func replaceCharacters(s string) string {
 		">":   ">",
 		" ": "",
 		"'":  "'",
+		"&":  "&",
 		"\n\n\n": "\n\n",
+		" \n":    "\n",
 	}
 	for old, new := range changeMap {
 		s = strings.Replace(s, old, new, -1)

Helper/problemReadme.go

@@ -1,7 +1,7 @@
 {
 	"Username": "aQuaYi",
 	"Ranking": 1089,
-	"Updated": "2018-05-21T10:15:29.898306051+08:00",
+	"Updated": "2018-05-21T16:20:26.257356889+08:00",
 	"Record": {
 		"Easy": {
 			"Solved": 169,
@@ -7117,7 +7117,7 @@
 			"ID": 591,
 			"Title": "Tag Validator",
 			"TitleSlug": "tag-validator",
-			"PassRate": "31%",
+			"PassRate": "30%",
 			"Difficulty": "Hard",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -9097,7 +9097,7 @@
 			"ID": 756,
 			"Title": "Pyramid Transition Matrix",
 			"TitleSlug": "pyramid-transition-matrix",
-			"PassRate": "46%",
+			"PassRate": "45%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -9457,7 +9457,7 @@
 			"ID": 786,
 			"Title": "K-th Smallest Prime Fraction",
 			"TitleSlug": "k-th-smallest-prime-fraction",
-			"PassRate": "32%",
+			"PassRate": "31%",
 			"Difficulty": "Hard",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -9877,7 +9877,7 @@
 			"ID": 821,
 			"Title": "Shortest Distance to a Character",
 			"TitleSlug": "shortest-distance-to-a-character",
-			"PassRate": "62%",
+			"PassRate": "63%",
 			"Difficulty": "Easy",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -10069,7 +10069,7 @@
 			"ID": 837,
 			"Title": "New 21 Game",
 			"TitleSlug": "new-21-game",
-			"PassRate": "20%",
+			"PassRate": "21%",
 			"Difficulty": "Medium",
 			"IsAccepted": false,
 			"IsPaid": false,
@@ -10081,7 +10081,7 @@
 			"ID": 838,
 			"Title": "Push Dominoes",
 			"TitleSlug": "push-dominoes",
-			"PassRate": "36%",
+			"PassRate": "37%",
 			"Difficulty": "Medium",
 			"IsAccepted": false,
 			"IsPaid": false,