feat: finish 48

Author: plh97

algorithm/48.RotateImage/README.md

@@ -0,0 +1,51 @@
+# [48. Rotate Image](https://leetcode.com/problems/rotate-image/)
+
+## 2019/09/15
+
+### 题目 💗[medium]
+
+You are given an n x n 2D matrix representing an image.
+
+Rotate the image by 90 degrees (clockwise).
+
+Note:
+
+You have to rotate the image in-place, which means you have to modify the input 2D matrix directly. DO NOT allocate another 2D matrix and do the rotation.
+
+Example 1:
+
+```bash
+Given input matrix =
+[
+  [1,2,3],
+  [4,5,6],
+  [7,8,9]
+],
+
+rotate the input matrix in-place such that it becomes:
+[
+  [7,4,1],
+  [8,5,2],
+  [9,6,3]
+]
+```
+
+Example 2:
+
+```bash
+Given input matrix =
+[
+  [ 5, 1, 9,11],
+  [ 2, 4, 8,10],
+  [13, 3, 6, 7],
+  [15,14,12,16]
+],
+
+rotate the input matrix in-place such that it becomes:
+[
+  [15,13, 2, 5],
+  [14, 3, 4, 1],
+  [12, 6, 8, 9],
+  [16, 7,10,11]
+]
+```

algorithm/48.RotateImage/main.go

@@ -0,0 +1,35 @@
+package deleteDuplicates
+
+import (
+	"github.com/pengliheng/leetcode/Helper"
+)
+
+type ListNode = Helper.ListNode
+
+func deleteDuplicates(head *ListNode) *ListNode {
+	arr := []int{}
+	for head != nil {
+		// remove duplicate
+		if lastIndexOf(arr, head.Val) == -1 {
+			arr = append(arr, head.Val)
+		}
+		head = head.Next
+	}
+	node := &ListNode{Val: 0}
+	newHead := node
+	for len(arr) > 0 {
+		node.Next = &ListNode{Val: arr[0]}
+		node = node.Next
+		arr = arr[1:]
+	}
+	return newHead.Next
+}
+
+func lastIndexOf(nums []int, val int) int {
+	for i := len(nums) - 1; i >= 0; i-- {
+		if nums[i] == val {
+			return i
+		}
+	}
+	return -1
+}

algorithm/48.RotateImage/main_test.go

@@ -0,0 +1,30 @@
+package deleteDuplicates
+
+import (
+	"testing"
+
+	"github.com/pengliheng/leetcode/Helper"
+
+	"github.com/stretchr/testify/assert"
+)
+
+var tcs = []struct {
+	N1  *ListNode
+	ans *ListNode
+}{
+	{
+		Helper.Ints2LinkList([]int{1, 1, 2}),
+		Helper.Ints2LinkList([]int{1, 2}),
+	},
+	{
+		Helper.Ints2LinkList([]int{1, 1, 2, 3, 3}),
+		Helper.Ints2LinkList([]int{1, 2, 3}),
+	},
+}
+
+func Test_bitwiseComplement(t *testing.T) {
+	ast := assert.New(t)
+	for _, tc := range tcs {
+		ast.Equal(tc.ans, deleteDuplicates(tc.N1), "输入:%v", tc)
+	}
+}