feat: add golang solution to lc problem: No.0108.Convert Sorted Array to Binary Search Tree

Author: yanglbme

solution/0100-0199/0108.Convert Sorted Array to Binary Search Tree/README.md

@@ -122,16 +122,15 @@ class Solution {
  */
 class Solution {
 public:
-    TreeNode* sortedArrayToBST(vector<int>& nums) {
+    TreeNode *sortedArrayToBST(vector<int> &nums) {
         return buildBST(nums, 0, nums.size() - 1);
     }
 
 private:
-    TreeNode* buildBST(vector<int>& nums, int start, int end) {
-        if (start > end) {
+    TreeNode *buildBST(vector<int> &nums, int start, int end) {
+        if (start > end)
             return nullptr;
-        }
-        int mid = (start + end) / 2;
+        int mid = start + end >> 1;
         TreeNode *root = new TreeNode(nums[mid]);
         root->left = buildBST(nums, start, mid - 1);
         root->right = buildBST(nums, mid + 1, end);
@@ -171,6 +170,34 @@ var sortedArrayToBST = function(nums) {
 };
 ```
 
+### **Go**
+
+```go
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ *     Val int
+ *     Left *TreeNode
+ *     Right *TreeNode
+ * }
+ */
+func sortedArrayToBST(nums []int) *TreeNode {
+	return buildBST(nums, 0, len(nums)-1)
+}
+
+func buildBST(nums []int, start, end int) *TreeNode {
+	if start > end {
+		return nil
+	}
+	mid := (start + end) >> 1
+	return &TreeNode{
+		Val:   nums[mid],
+		Left:  buildBST(nums, start, mid-1),
+		Right: buildBST(nums, mid+1, end),
+	}
+}
+```
+
 ### **...**
 
 ```

solution/0100-0199/0108.Convert Sorted Array to Binary Search Tree/README_EN.md

@@ -112,16 +112,15 @@ class Solution {
  */
 class Solution {
 public:
-    TreeNode* sortedArrayToBST(vector<int>& nums) {
+    TreeNode *sortedArrayToBST(vector<int> &nums) {
         return buildBST(nums, 0, nums.size() - 1);
     }
 
 private:
-    TreeNode* buildBST(vector<int>& nums, int start, int end) {
-        if (start > end) {
+    TreeNode *buildBST(vector<int> &nums, int start, int end) {
+        if (start > end)
             return nullptr;
-        }
-        int mid = (start + end) / 2;
+        int mid = start + end >> 1;
         TreeNode *root = new TreeNode(nums[mid]);
         root->left = buildBST(nums, start, mid - 1);
         root->right = buildBST(nums, mid + 1, end);
@@ -161,6 +160,34 @@ var sortedArrayToBST = function(nums) {
 };
 ```
 
+### **Go**
+
+```go
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ *     Val int
+ *     Left *TreeNode
+ *     Right *TreeNode
+ * }
+ */
+func sortedArrayToBST(nums []int) *TreeNode {
+	return buildBST(nums, 0, len(nums)-1)
+}
+
+func buildBST(nums []int, start, end int) *TreeNode {
+	if start > end {
+		return nil
+	}
+	mid := (start + end) >> 1
+	return &TreeNode{
+		Val:   nums[mid],
+		Left:  buildBST(nums, start, mid-1),
+		Right: buildBST(nums, mid+1, end),
+	}
+}
+```
+
 ### **...**
 
 ```

solution/0100-0199/0108.Convert Sorted Array to Binary Search Tree/Solution.cpp

@@ -11,16 +11,15 @@
  */
 class Solution {
 public:
-    TreeNode* sortedArrayToBST(vector<int>& nums) {
+    TreeNode *sortedArrayToBST(vector<int> &nums) {
         return buildBST(nums, 0, nums.size() - 1);
     }
 
 private:
-    TreeNode* buildBST(vector<int>& nums, int start, int end) {
-        if (start > end) {
+    TreeNode *buildBST(vector<int> &nums, int start, int end) {
+        if (start > end)
             return nullptr;
-        }
-        int mid = (start + end) / 2;
+        int mid = start + end >> 1;
         TreeNode *root = new TreeNode(nums[mid]);
         root->left = buildBST(nums, start, mid - 1);
         root->right = buildBST(nums, mid + 1, end);

solution/0100-0199/0108.Convert Sorted Array to Binary Search Tree/Solution.go

@@ -0,0 +1,23 @@
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ *     Val int
+ *     Left *TreeNode
+ *     Right *TreeNode
+ * }
+ */
+func sortedArrayToBST(nums []int) *TreeNode {
+	return buildBST(nums, 0, len(nums)-1)
+}
+
+func buildBST(nums []int, start, end int) *TreeNode {
+	if start > end {
+		return nil
+	}
+	mid := (start + end) >> 1
+	return &TreeNode{
+		Val:   nums[mid],
+		Left:  buildBST(nums, start, mid-1),
+		Right: buildBST(nums, mid+1, end),
+	}
+}

solution/0200-0299/0289.Game of Life/README.md

@@ -6,7 +6,7 @@
 
 <!-- 这里写题目描述 -->
 
-<p>根据 <a href="https://baike.baidu.com/item/%E7%94%9F%E5%91%BD%E6%B8%B8%E6%88%8F/2926434?fr=aladdin" target="_blank">百度百科</a> ，生命游戏，简称为生命，是英国数学家约翰·何顿·康威在 1970 年发明的细胞自动机。</p>
+<p>根据 <a href="https://baike.baidu.com/item/%E7%94%9F%E5%91%BD%E6%B8%B8%E6%88%8F/2926434?fr=aladdin" target="_blank">百度百科</a> ，生命游戏，简称为生命，是英国数学家约翰·何顿·康威在 1970 年发明的 cellular automaton。</p>
 
 <p>给定一个包含 m × n 个格子的面板，每一个格子都可以看成是一个细胞。每个细胞都具有一个初始状态：1 即为活细胞（live），或 0 即为死细胞（dead）。每个细胞与其八个相邻位置（水平，垂直，对角线）的细胞都遵循以下四条生存定律：</p>