Add solution and test-cases for problem 1169

Author: 0xff-dev

leetcode/1101-1200/1169.Invalid-Transactions/README.md

@@ -1,28 +1,36 @@
 # [1169.Invalid Transactions][title]
 
-> [!WARNING|style:flat]
-> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
-
 ## Description
+A transaction is possibly invalid if:
+
+- the amount exceeds `$1000`, or;
+- if it occurs within (and including) `60` minutes of another transaction with the **same name** in a **different city**.
+
+You are given an array of strings `transactions` where `transactions[i]` consists of comma-separated values representing the name, time (in minutes), amount, and city of the transaction.
+
+Return a list of `transactions` that are possibly invalid. You may return the answer in **any order**.
 
 **Example 1:**
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+Input: transactions = ["alice,20,800,mtv","alice,50,100,beijing"]
+Output: ["alice,20,800,mtv","alice,50,100,beijing"]
+Explanation: The first transaction is invalid because the second transaction occurs within a difference of 60 minutes, have the same name and is in a different city. Similarly the second one is invalid too.
 ```
 
-## 题意
-> ...
-
-## 题解
+**Example 2:**
 
-### 思路1
-> ...
-Invalid Transactions
-```go
 ```
+Input: transactions = ["alice,20,800,mtv","alice,50,1200,mtv"]
+Output: ["alice,50,1200,mtv"]
+```
+
+**Example 3:**
 
+```
+Input: transactions = ["alice,20,800,mtv","bob,50,1200,mtv"]
+Output: ["bob,50,1200,mtv"]
+```
 
 ## 结语
 

leetcode/1101-1200/1169.Invalid-Transactions/Solution.go

@@ -1,5 +1,75 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+import (
+	"fmt"
+	"sort"
+	"strconv"
+	"strings"
+)
+
+type transaction struct {
+	name         string
+	time, amount int
+	city         string
+}
+
+func (tr transaction) String() string {
+	return fmt.Sprintf("%s,%d,%d,%s", tr.name, tr.time, tr.amount, tr.city)
+}
+
+func Solution(transactions []string) []string {
+	list := make([]transaction, len(transactions))
+	for i, trans := range transactions {
+		items := strings.Split(trans, ",")
+		time, _ := strconv.Atoi(items[1])
+		amount, _ := strconv.Atoi(items[2])
+		list[i] = transaction{
+			name:   items[0],
+			time:   time,
+			amount: amount,
+			city:   items[3],
+		}
+	}
+	var ret []string
+	sort.Slice(list, func(i, j int) bool {
+		// 感觉时间排序
+		a, b := list[i], list[j]
+		if a.time == b.time {
+			return a.name < b.name
+		}
+		return a.time < b.time
+	})
+
+	group := make(map[string][]transaction)
+	for _, item := range list {
+		if _, ok := group[item.name]; !ok {
+			group[item.name] = make([]transaction, 0)
+		}
+		group[item.name] = append(group[item.name], item)
+	}
+	for _, trans := range group {
+		invalid := make([]bool, len(trans))
+		for i := 0; i < len(trans); i++ {
+
+			for pre := i - 1; pre >= 0; pre-- {
+				if trans[i].city == trans[pre].city {
+					continue
+				}
+				if trans[i].time <= trans[pre].time+60 {
+					invalid[i] = true
+					invalid[pre] = true
+				}
+			}
+			if trans[i].amount > 1000 {
+				invalid[i] = true
+				continue
+			}
+		}
+		for i := range trans {
+			if invalid[i] {
+				ret = append(ret, trans[i].String())
+			}
+		}
+	}
+	return ret
 }

leetcode/1101-1200/1169.Invalid-Transactions/Solution_test.go

@@ -10,12 +10,12 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
-		expect bool
+		inputs []string
+		expect []string
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase1", []string{"alice,20,800,mtv", "alice,50,100,beijing"}, []string{"alice,20,800,mtv", "alice,50,100,beijing"}},
+		{"TestCase2", []string{"alice,20,800,mtv", "alice,50,1200,mtv"}, []string{"alice,50,1200,mtv"}},
+		{"TestCase3", []string{"alice,20,800,mtv", "bob,50,1200,mtv"}, []string{"bob,50,1200,mtv"}},
 	}
 
 	//	开始测试
@@ -30,10 +30,10 @@ func TestSolution(t *testing.T) {
 	}
 }
 
-//	压力测试
+// 压力测试
 func BenchmarkSolution(b *testing.B) {
 }
 
-//	使用案列
+// 使用案列
 func ExampleSolution() {
 }