✨2769.找出最大的可达成数字

Author: techoc

README.md

@@ -140,6 +140,7 @@
 - [2739.总行驶距离](leetcode/easy/t2739/solution.go)
 - [2760.最长奇偶子数组](leetcode/easy/t2760/solution.go)
 - [2765.最长交替子数组](leetcode/easy/t2765/solution.go)
+- [2769.找出最大的可达成数字](leetcode/easy/t2769/solution.go)
 - [2798.满足目标工作时长的员工数目](leetcode/easy/t2798/solution.go)
 - [2894.分类求和并做差](leetcode/easy/t2894/solution.go)
 - [2908.元素和最小的山形三元组 I](leetcode/easy/t2908/solution.go)

leetcode/easy/t2769/solution.go

@@ -0,0 +1,7 @@
+package t2769
+
+// 2769. 找出最大的可达成数字
+// https://leetcode.cn/problems/find-the-maximum-achievable-number
+func theMaximumAchievableX(num int, t int) int {
+	return num + t*2
+}

leetcode/easy/t2769/solution_test.go

@@ -0,0 +1,32 @@
+package t2769
+
+import "testing"
+
+func TestTheMaximumAchievableX(t *testing.T) {
+	tests := []struct {
+		name string
+		num  int
+		t    int
+		want int
+	}{
+		{
+			name: "Case 1",
+			num:  4,
+			t:    1,
+			want: 6,
+		},
+		{
+			name: "Case 2",
+			num:  3,
+			t:    2,
+			want: 7,
+		},
+	}
+	for _, tt := range tests {
+		t.Run(tt.name, func(t *testing.T) {
+			if got := theMaximumAchievableX(tt.num, tt.t); got != tt.want {
+				t.Errorf("theMaximumAchievableX() = %v, want %v", got, tt.want)
+			}
+		})
+	}
+}