added problem 1047

Author: SHA65536

Diff for: problems/problem1047/remove_adj.go

@@ -0,0 +1,22 @@
+package problem1047
+
+/*
+You are given a string s consisting of lowercase English letters.
+A duplicate removal consists of choosing two adjacent and equal letters and removing them.
+We repeatedly make duplicate removals on s until we no longer can.
+Return the final string after all such duplicate removals have been made. It can be proven that the answer is unique.
+*/
+
+func removeDuplicates(s string) string {
+	var res = []byte(s)
+	var cur int
+	for i := 0; i < len(res); i++ {
+		if cur > 0 && res[i] == res[cur-1] {
+			cur--
+		} else {
+			res[cur] = res[i]
+			cur++
+		}
+	}
+	return string(res[0:cur])
+}

Diff for: problems/problem1047/remove_adj_test.go

@@ -0,0 +1,28 @@
+package problem1047
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+type Result struct {
+	Input    string
+	Expected string
+}
+
+var Results = []Result{
+	{"abbaca", "ca"},
+	{"azxxzy", "ay"},
+}
+
+func TestRemoveAdjacent(t *testing.T) {
+	assert := assert.New(t)
+
+	for _, res := range Results {
+		want := res.Expected
+		got := removeDuplicates(res.Input)
+		assert.Equal(want, got, fmt.Sprintf("%+v", res))
+	}
+}

Diff for: readme.md

@@ -201,6 +201,7 @@ Each problem is in it's own directory, with test files. There are helper package
 | 0999 | [Available Captures for Rook](https://leetcode.com/problems/available-captures-for-rook) | [My Solution](./problems/problem0999) | ✅ |
 | 1009 | [Complement of Base 10 Integer](https://leetcode.com/problems/complement-of-base-10-integer) | [My Solution](./problems/problem1009) | ✅ |
 | 1013 | [Partition Array Into Three Parts With Equal Sum](https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum) | [My Solution](./problems/problem1013) | ✅ |
+| 1047 | [Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string) | [My Solution](./problems/problem1047) | ✅ |
 | 1026 | [Maximum Difference Between Node and Ancestor](https://leetcode.com/problems/maximum-difference-between-node-and-ancestor) | [My Solution](./problems/problem1026) | ✅ |
 | 1038 | [Binary Search Tree to Greater Sum Tree](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree) | [My Solution](./problems/problem1038) | ✅ |
 | 1048 | [Longest String Chain](https://leetcode.com/problems/longest-string-chain) | [My Solution](./problems/problem1048) | ✅ |