850 wrong answer

Author: aQua

Algorithms/0850.rectangle-area-ii/README.md

@@ -0,0 +1,36 @@
+# [850. Rectangle Area II](https://leetcode.com/problems/rectangle-area-ii/)
+
+## 题目
+
+We are given a list of (axis-aligned)rectangles. Eachrectangle[i] = [x1, y1, x2, y2], where (x1, y1) are the coordinates of the bottom-left corner, and (x2, y2) are the coordinates of the top-right corner of the ith rectangle.
+
+Find the total area covered by all rectangles in the plane. Since the answermay be too large, return it modulo 10^9 + 7.
+
+![pic](rectangle_area_ii_pic.png)
+
+Example 1:
+
+```text
+Input: [[0,0,2,2],[1,0,2,3],[1,0,3,1]]
+Output: 6
+Explanation: As illustrated in the picture.
+```
+
+Example 2:
+
+```text
+Input: [[0,0,1000000000,1000000000]]
+Output: 49
+Explanation: The answer is 10^18 modulo (10^9 + 7), which is (10^9)^2 = (-7)^2 = 49.
+```
+
+Note:
+
+1. 1 <= rectangles.length <= 200
+1. rectanges[i].length = 4
+1. 0 <= rectangles[i][j] <= 10^9
+1. The total area covered by all rectangles will never exceed2^63 - 1and thus will fit in a 64-bit signed integer.
+
+## 解题思路
+
+见程序注释

Algorithms/0850.rectangle-area-ii/rectangle-area-ii.go

@@ -0,0 +1,15 @@
+package problem0850
+
+const mod = 1e9 + 7
+
+func rectangleArea(rectangles [][]int) int {
+	sum := 0
+	for _, r := range rectangles {
+		sum += area(r)
+	}
+	return sum % mod
+}
+
+func area(r []int) int {
+	return ((r[2] - r[0]) * (r[3] - r[1])) % mod
+}

Algorithms/0850.rectangle-area-ii/rectangle-area-ii_test.go

@@ -0,0 +1,44 @@
+package problem0850
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+// tcs is testcase slice
+var tcs = []struct {
+	rectangles [][]int
+	ans        int
+}{
+
+	{
+		[][]int{{0, 0, 2, 2}, {1, 0, 2, 3}, {1, 0, 3, 1}},
+		6,
+	},
+
+	{
+		[][]int{{0, 0, 1000000000, 1000000000}},
+		49,
+	},
+
+	// 可以有多个 testcase
+}
+
+func Test_rectangleArea(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, tc := range tcs {
+		fmt.Printf("~~%v~~\n", tc)
+		ast.Equal(tc.ans, rectangleArea(tc.rectangles), "输入:%v", tc)
+	}
+}
+
+func Benchmark_rectangleArea(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range tcs {
+			rectangleArea(tc.rectangles)
+		}
+	}
+}

Algorithms/0850.rectangle-area-ii/rectangle_area_ii_pic.png

@@ -1,22 +1,22 @@
 {
 	"Username": "aQuaYi",
 	"Ranking": 997,
-	"Updated": "2018-07-04T05:44:33.515334967+08:00",
+	"Updated": "2018-07-04T06:04:51.061950892+08:00",
 	"Record": {
 		"Easy": {
 			"Solved": 175,
 			"Total": 178
 		},
 		"Medium": {
-			"Solved": 301,
+			"Solved": 302,
 			"Total": 309
 		},
 		"Hard": {
 			"Solved": 130,
 			"Total": 135
 		},
 		"Total": {
-			"Solved": 606,
+			"Solved": 607,
 			"Total": 622
 		}
 	},
@@ -7117,7 +7117,7 @@
 			"ID": 591,
 			"Title": "Tag Validator",
 			"TitleSlug": "tag-validator",
-			"PassRate": "30%",
+			"PassRate": "31%",
 			"Difficulty": "Hard",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -9481,7 +9481,7 @@
 			"ID": 788,
 			"Title": "Rotated Digits",
 			"TitleSlug": "rotated-digits",
-			"PassRate": "51%",
+			"PassRate": "50%",
 			"Difficulty": "Easy",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -10189,7 +10189,7 @@
 			"ID": 847,
 			"Title": "Shortest Path Visiting All Nodes",
 			"TitleSlug": "shortest-path-visiting-all-nodes",
-			"PassRate": "39%",
+			"PassRate": "40%",
 			"Difficulty": "Hard",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -10203,7 +10203,7 @@
 			"TitleSlug": "shifting-letters",
 			"PassRate": "34%",
 			"Difficulty": "Medium",
-			"IsAccepted": false,
+			"IsAccepted": true,
 			"IsPaid": false,
 			"IsFavor": false,
 			"IsNew": false,