add 611 solution

Author: 6boris

src/0611.Valid-Triangle-Number/README.md

@@ -0,0 +1,45 @@
+# [611. Valid Triangle Number][title]
+
+## Description
+
+Given an array consists of non-negative integers, your task is to count the number of triplets chosen from the array that can make triangles if we take them as side lengths of a triangle.
+**Example 1:**
+
+```
+Input: a = "11", b = "1"
+Output: "100"
+```
+
+**Example 2:**
+
+```
+Input: a = "1010", b = "1011"
+Output: "10101"
+```
+
+**Tags:** Math, String
+
+## 题意
+> 求2数之和
+
+## 题解
+
+### 思路1
+> 。。。。
+
+```go
+
+```
+
+### 思路2
+> 思路2
+```go
+
+```
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-leetcode][me]
+
+[title]: https://leetcode.com/problems/valid-triangle-number/
+[me]: https://github.com/kylesliu/awesome-golang-leetcode

src/0611.Valid-Triangle-Number/Solution.go

@@ -0,0 +1,40 @@
+package Solution
+
+func triangleNumber(nums []int) int {
+	n, ans := len(nums), 0
+	nums = Sort(nums)
+	for c := 0; c < n-1; c++ {
+		a, b := n-1, c+1
+		for b < a {
+			if nums[a]+nums[b] > nums[c] {
+				ans += (a - b)
+				b++
+			} else {
+				a--
+			}
+		}
+
+	}
+	return ans
+}
+
+func Sort(nums []int) []int {
+	if len(nums) == 0 {
+		return []int{}
+	}
+	max := nums[0]
+	var left_res, right_res, res []int
+	for i := 1; i < len(nums); i++ {
+		if nums[i] > max {
+			left_res = append(left_res, nums[i])
+		} else {
+			right_res = append(right_res, nums[i])
+		}
+	}
+	left_res = Sort(left_res)
+	right_res = Sort(right_res)
+	res = append(res, left_res...)
+	res = append(res, max)
+	res = append(res, right_res...)
+	return res
+}

src/0611.Valid-Triangle-Number/Solution_test.go

@@ -0,0 +1,39 @@
+package Solution
+
+import (
+	"reflect"
+	"strconv"
+	"testing"
+)
+
+func TestSolution(t *testing.T) {
+	//	测试用例
+	cases := []struct {
+		name   string
+		inputs []int
+		expect int
+	}{
+		{"TestCase", []int{2, 2, 3, 4}, 3},
+	}
+
+	//	开始测试
+	for i, c := range cases {
+		t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {
+			got := triangleNumber(c.inputs)
+			if !reflect.DeepEqual(got, c.expect) {
+				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
+					c.expect, got, c.inputs)
+			}
+		})
+	}
+}
+
+//	压力测试
+func BenchmarkSolution(b *testing.B) {
+
+}
+
+//	使用案列
+func ExampleSolution() {
+
+}