golang

Author: shuzijun

.github/workflows/badge.yml

@@ -0,0 +1,23 @@
+# This is a basic workflow to help you get started with Actions
+
+name: badge
+
+on:
+  push:
+    branches:
+      - golang
+  workflow_dispatch:
+
+jobs:
+
+  build:
+    runs-on: ubuntu-latest
+
+    steps:
+      - uses: actions/checkout@v3
+
+      - uses: shuzijun/[email protected]
+        with:
+          STATISTICS_DIRECTORY: .idea/leetcode-pro/
+          LEETCODE_SITE: leetcode.cn
+

.gitignore

@@ -22,5 +22,6 @@
 # virtual machine crash logs, see http://www.java.com/en/download/help/error_hotspot.xml
 hs_err_pid*
 
-src/main/java/com/shuzijun/leetcode/editor/cn/doc/solution/*.*
-src/main/java/com/shuzijun/leetcode/editor/cn/doc/submission/*.*
+.idea
+src/leetcode/editor/cn/doc/*.*
+src/leetcode/editor/cn/doc/*/*.*

.idea/leetcode-pro/editor.xml

@@ -1,29 +1,44 @@
 # leetcode-question
-  [leetcode-editor](https://github.com/shuzijun/leetcode-editor) custom code demo     
-  This branch is a private record branch. For configuration examples, please refer to master.    
-## leetcode-editor config  
-  CodeFileName:
-  ```java
-  Q${question.frontendQuestionId}$!velocityTool.camelCaseName(${question.titleSlug})
-  ```
-  CodeTemplate:
-  ```java
-    package com.shuzijun.leetcode.editor.cn;
-    ${question.content}
-    
-    public class Q${question.frontendQuestionId}$!velocityTool.camelCaseName(${question.titleSlug}){
-    public static void main(String[] args) {
-        Solution solution = new Q${question.frontendQuestionId}$!velocityTool.camelCaseName(${question.titleSlug})().new Solution();
-        }
-        ${question.code}
-    }
-  ```
-  TemplateConstant:
-  ```
-    ${question.title}	question title	ex:Two Sum
-    ${question.titleSlug}	question title slug 	ex:two-sum
-    ${question.frontendQuestionId}	question serial number
-    ${question.content}	question content
-    ${question.code}	question code
-    $!velocityTool.camelCaseName(str)	transform str camel case
-  ```
+
+[leetcode-editor](https://github.com/shuzijun/leetcode-editor) custom code demo
+
+## Progress
+
+<!--START_SECTION_FLAG-->
+
+![Progress](https://img.shields.io/static/v1?logo=leetcode&label=Progress&message=47%2F2647&color=brightgreen)  ![Easy](https://img.shields.io/static/v1?logo=leetcode&label=Easy&message=58&color=5CB85C)  ![Medium](https://img.shields.io/static/v1?logo=leetcode&label=Medium&message=106&color=F0AD4E)  ![Hard](https://img.shields.io/static/v1?logo=leetcode&label=Hard&message=12&color=D9534F)  <!--END_SECTION_FLAG-->
+
+## leetcode-editor config
+
+CodeFileName:
+
+```java
+Q${question.frontendQuestionId}$!velocityTool.camelCaseName(${question.titleSlug})_test
+```
+
+CodeTemplate:
+
+```go
+  package main
+
+  import "testing"
+  
+  ${q.content}
+  
+  func Test$!vt.camelCaseName(${q.codeMetaData.name})(t *testing.T) {
+  
+  }
+  
+  ${q.code}
+```
+
+TemplateConstant:
+
+```
+  ${question.title}	question title	ex:Two Sum
+  ${question.titleSlug}	question title slug 	ex:two-sum
+  ${question.frontendQuestionId}	question serial number
+  ${question.content}	question content
+  ${question.code}	question code
+  $!velocityTool.camelCaseName(str)	transform str camel case
+```

README.md

@@ -0,0 +1,4 @@
+module github.com/shuzijun/leetcode-question
+
+go 1.18
+

go.mod

@@ -0,0 +1,71 @@
+package main
+
+import (
+	"testing"
+)
+
+/**
+<p>给定一个整数数组 <code>nums</code>&nbsp;和一个整数目标值 <code>target</code>，请你在该数组中找出 <strong>和为目标值 </strong><em><code>target</code></em>&nbsp; 的那&nbsp;<strong>两个</strong>&nbsp;整数，并返回它们的数组下标。</p>
+
+<p>你可以假设每种输入只会对应一个答案。但是，数组中同一个元素在答案里不能重复出现。</p>
+
+<p>你可以按任意顺序返回答案。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>nums = [2,7,11,15], target = 9
+<strong>输出：</strong>[0,1]
+<strong>解释：</strong>因为 nums[0] + nums[1] == 9 ，返回 [0, 1] 。
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre>
+<strong>输入：</strong>nums = [3,2,4], target = 6
+<strong>输出：</strong>[1,2]
+</pre>
+
+<p><strong>示例 3：</strong></p>
+
+<pre>
+<strong>输入：</strong>nums = [3,3], target = 6
+<strong>输出：</strong>[0,1]
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+ <li><code>2 &lt;= nums.length &lt;= 10<sup>4</sup></code></li>
+ <li><code>-10<sup>9</sup> &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
+ <li><code>-10<sup>9</sup> &lt;= target &lt;= 10<sup>9</sup></code></li>
+ <li><strong>只会存在一个有效答案</strong></li>
+</ul>
+
+<p><strong>进阶：</strong>你可以想出一个时间复杂度小于 <code>O(n<sup>2</sup>)</code> 的算法吗？</p>
+
+<div><details><summary>Related Topics</summary><div><li>数组</li><li>哈希表</li></div></details></div>
+<div><li>👍 15503</li><li>👎 0</li></div>
+*/
+
+func TestTwoSum(t *testing.T) {
+	t.Log(twoSum([]int{2, 7, 11, 15}, 9))
+}
+
+//leetcode submit region begin(Prohibit modification and deletion)
+func twoSum(nums []int, target int) []int {
+	hashTable := map[int]int{}
+	for i, x := range nums {
+		if p, ok := hashTable[target-x]; ok {
+			return []int{p, i}
+		}
+		hashTable[x] = i
+	}
+	return nil
+}
+
+//leetcode submit region end(Prohibit modification and deletion)