Add solution 1603、1608、1700、1710、1716、1720、1725、1732、1736、1742、1748、1752、1758

This commit is contained in:
YDZ
2021-02-15 13:20:24 +08:00
parent 9de9488b04
commit 917d613465
74 changed files with 3220 additions and 304 deletions

View File

@ -0,0 +1,10 @@
package leetcode
func decode(encoded []int, first int) []int {
arr := make([]int, len(encoded)+1)
arr[0] = first
for i, val := range encoded {
arr[i+1] = arr[i] ^ val
}
return arr
}

View File

@ -0,0 +1,48 @@
package leetcode
import (
"fmt"
"testing"
)
type question1720 struct {
para1720
ans1720
}
// para 是参数
// one 代表第一个参数
type para1720 struct {
encoded []int
first int
}
// ans 是答案
// one 代表第一个答案
type ans1720 struct {
one []int
}
func Test_Problem1720(t *testing.T) {
qs := []question1720{
{
para1720{[]int{1, 2, 3}, 1},
ans1720{[]int{1, 0, 2, 1}},
},
{
para1720{[]int{6, 2, 7, 3}, 4},
ans1720{[]int{4, 2, 0, 7, 4}},
},
}
fmt.Printf("------------------------Leetcode Problem 1720------------------------\n")
for _, q := range qs {
_, p := q.ans1720, q.para1720
fmt.Printf("【input】:%v 【output】:%v\n", p, decode(p.encoded, p.first))
}
fmt.Printf("\n\n\n")
}

View File

@ -0,0 +1,59 @@
# [1720. Decode XORed Array](https://leetcode.com/problems/decode-xored-array/)
## 题目
There is a **hidden** integer array `arr` that consists of `n` non-negative integers.
It was encoded into another integer array `encoded` of length `n - 1`, such that `encoded[i] = arr[i] XOR arr[i + 1]`. For example, if `arr = [1,0,2,1]`, then `encoded = [1,2,3]`.
You are given the `encoded` array. You are also given an integer `first`, that is the first element of `arr`, i.e. `arr[0]`.
Return *the original array* `arr`. It can be proved that the answer exists and is unique.
**Example 1:**
```
Input: encoded = [1,2,3], first = 1
Output: [1,0,2,1]
Explanation: If arr = [1,0,2,1], then first = 1 and encoded = [1 XOR 0, 0 XOR 2, 2 XOR 1] = [1,2,3]
```
**Example 2:**
```
Input: encoded = [6,2,7,3], first = 4
Output: [4,2,0,7,4]
```
**Constraints:**
- `2 <= n <= 104`
- `encoded.length == n - 1`
- `0 <= encoded[i] <= 105`
- `0 <= first <= 10^5`
## 题目大意
未知 整数数组 arr 由 n 个非负整数组成。经编码后变为长度为 n - 1 的另一个整数数组 encoded ,其中 encoded[i] = arr[i] XOR arr[i + 1] 。例如arr = [1,0,2,1] 经编码后得到 encoded = [1,2,3] 。给你编码后的数组 encoded 和原数组 arr 的第一个元素 firstarr[0])。请解码返回原数组 arr 。可以证明答案存在并且是唯一的。
## 解题思路
- 简单题。按照题意,求返回解码以后的原数组,即将编码后的数组前后两两元素依次做异或 `XOR` 运算。
## 代码
```go
package leetcode
func decode(encoded []int, first int) []int {
arr := make([]int, len(encoded)+1)
arr[0] = first
for i, val := range encoded {
arr[i+1] = arr[i] ^ val
}
return arr
}
```