feat: finish 394

Author: plh97

algorithm/394.DecodeString/README.md

@@ -0,0 +1,20 @@
+# [394. Decode String](https://leetcode.com/problems/decode-string/)
+
+## 2019/09/10
+
+### 题目 💗[medium]
+
+Given an encoded string, return its decoded string.
+
+The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times. Note that k is guaranteed to be a positive integer.
+
+You may assume that the input string is always valid; No extra white spaces, square brackets are well-formed, etc.
+
+Furthermore, you may assume that the original data does not contain any digits and that digits are only for those repeat numbers, k. For example, there won't be input like 3a or 2[4].
+
+Examples:
+
+- s = "3[a]2[bc]", return "aaabcbc".
+- s = "3[a2[c]]", return "accaccacc".
+- s = "2[abc]3[cd]ef", return "abcabccdcdcdef".
+ 

algorithm/394.DecodeString/index.js

@@ -0,0 +1,32 @@
+/**
+ * @param {string} s
+ * @return {string}
+ */
+var decodeString = function (s) {
+  console.log(s);
+  if (s.split("").indexOf('[') == -1) return s;
+  let res=""
+  let startIndex, endIndex = 0;
+  // startIndex = s.split("").indexOf('[');
+  // endIndex = s.split("").lastIndexOf(']');
+  s.split("").forEach((e,i) => {
+    if (e==)
+    number = s.match(/\d+(?=\[)/g)
+    console.log(startIndex, endIndex, number);
+    let a = s.substring(-1, startIndex - number.length)
+    let b = decodeString(s.substring(startIndex + 1, endIndex))
+    let c = s.substring(endIndex + 1)
+    return a + b.repeat(number) + c
+  })
+
+
+
+
+  return res
+};
+
+
+console.log(
+  // decodeString("100[leetcode]"),
+  decodeString("3[a]2[bc]"),
+)

algorithm/394.DecodeString/main.go

@@ -0,0 +1,30 @@
+package decodeString
+
+import "strings"
+
+func decodeString(s string) string {
+	stringStack := []string{}
+	numberStack := []int{}
+	res := ""
+	num := 0
+	for _, e := range s {
+		switch {
+		case e >= '0' && e <= '9':
+			num = 10*num + int(e-'0')
+		case e == '[':
+			numberStack = append(numberStack, num)
+			num = 0
+			stringStack = append(stringStack, res)
+			res = ""
+		case e == ']':
+			strTemp := stringStack[len(stringStack)-1]
+			stringStack = stringStack[:len(stringStack)-1]
+			numTemp := numberStack[len(numberStack)-1]
+			numberStack = numberStack[:len(numberStack)-1]
+			res = strTemp + strings.Repeat(res, numTemp)
+		default:
+			res += string(e)
+		}
+	}
+	return res
+}

algorithm/394.DecodeString/main_test.go

@@ -0,0 +1,36 @@
+package decodeString
+
+import (
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+var tcs = []struct {
+	N1  string
+	ans string
+}{
+	// {
+	// 	"3[a]2[bc]",
+	// 	"aaabcbc",
+	// },
+	// {
+	// 	"3[a2[c]]",
+	// 	"accaccacc",
+	// },
+	// {
+	// 	"2[abc]3[cd]ef",
+	// 	"abcabccdcdcdef",
+	// },
+	{
+		"100[leetcode]",
+		"leetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcodeleetcode",
+	},
+}
+
+func Test_bitwiseComplement(t *testing.T) {
+	ast := assert.New(t)
+	for _, tc := range tcs {
+		ast.Equal(tc.ans, decodeString(tc.N1), "输入:%v", tc)
+	}
+}