Skip to content

feat: add solutions to lc problem: No.0822 #1369

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Aug 2, 2023
Merged

feat: add solutions to lc problem: No.0822 #1369

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
114 changes: 75 additions & 39 deletions solution/0800-0899/0822.Card Flipping Game/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -42,7 +42,15 @@

**方法一：哈希表**

对于位置 i，若 `fronts[i]` 与 `backs[i]` 元素相同，则一定不满足条件。找其他出现在 fronts 或 backs 中的元素的最小值即可。
我们注意到，对于位置 $i$，若 $fronts[i]$ 与 $backs[i]$ 元素相同，则一定不满足条件。

因此，我们先找出正面与背面相同的元素，记录在哈希表 $s$ 中。

接下来，遍历正面与背面的元素，若元素 $x$ 不在哈希表 $s$ 中，则更新答案的最小值。

最后，若找到一个满足条件的元素，返回答案，否则返回 $0$。

时间复杂度 $O(n)$，空间复杂度 $O(n)$。其中 $n$ 是数组的长度。

<!-- tabs:start -->

Expand All @@ -53,12 +61,8 @@
```python
class Solution:
def flipgame(self, fronts: List[int], backs: List[int]) -> int:
same = {a for a, b in zip(fronts, backs) if a == b}
ans = 9999
for x in chain(fronts, backs):
if x not in same:
ans = min(ans, x)
return ans % 9999
s = {a for a, b in zip(fronts, backs) if a == b}
return min((x for x in chain(fronts, backs) if x not in s), default=0)
```

### **Java**
Expand Down Expand Up @@ -99,16 +103,22 @@ public:
int flipgame(vector<int>& fronts, vector<int>& backs) {
unordered_set<int> s;
int n = fronts.size();
for (int i = 0; i < n; ++i)
if (fronts[i] == backs[i])
for (int i = 0; i < n; ++i) {
if (fronts[i] == backs[i]) {
s.insert(fronts[i]);
}
}
int ans = 9999;
for (int& v : fronts)
if (!s.count(v))
for (int& v : fronts) {
if (!s.count(v)) {
ans = min(ans, v);
for (int& v : backs)
if (!s.count(v))
}
}
for (int& v : backs) {
if (!s.count(v)) {
ans = min(ans, v);
}
}
return ans % 9999;
}
};
Expand All @@ -118,20 +128,20 @@ public:

```go
func flipgame(fronts []int, backs []int) int {
s := map[int]bool{}
for i, v := range fronts {
if v == backs[i] {
s[v] = true
s := map[int]struct{}{}
for i, a := range fronts {
if a == backs[i] {
s[a] = struct{}{}
}
}
ans := 9999
for _, v := range fronts {
if !s[v] {
if _, ok := s[v]; !ok {
ans = min(ans, v)
}
}
for _, v := range backs {
if !s[v] {
if _, ok := s[v]; !ok {
ans = min(ans, v)
}
}
Expand All @@ -150,26 +160,52 @@ func min(a, b int) int {

```ts
function flipgame(fronts: number[], backs: number[]): number {
const s: Set<number> = new Set();
const n = fronts.length;
for (let i = 0; i < n; ++i) {
if (fronts[i] === backs[i]) {
s.add(fronts[i]);
}
}
let ans = 9999;
for (const v of fronts) {
if (!s.has(v)) {
ans = Math.min(ans, v);
}
}
for (const v of backs) {
if (!s.has(v)) {
ans = Math.min(ans, v);
}
}
return ans % 9999;
};
const s: Set<number> = new Set();
const n = fronts.length;
for (let i = 0; i < n; ++i) {
if (fronts[i] === backs[i]) {
s.add(fronts[i]);
}
}
let ans = 9999;
for (const v of fronts) {
if (!s.has(v)) {
ans = Math.min(ans, v);
}
}
for (const v of backs) {
if (!s.has(v)) {
ans = Math.min(ans, v);
}
}
return ans % 9999;
}
```

### **C#**

```cs
public class Solution {
public int Flipgame(int[] fronts, int[] backs) {
var s = new HashSet<int>();
int n = fronts.Length;
for (int i = 0; i < n; ++i) {
if (fronts[i] == backs[i]) {
s.Add(fronts[i]);
}
}
int ans = 9999;
for (int i = 0; i < n; ++i) {
if (!s.Contains(fronts[i])) {
ans = Math.Min(ans, fronts[i]);
}
if (!s.Contains(backs[i])) {
ans = Math.Min(ans, backs[i]);
}
}
return ans % 9999;
}
}
```

### **...**
Expand Down
104 changes: 66 additions & 38 deletions solution/0800-0899/0822.Card Flipping Game/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -49,12 +49,8 @@ There are no good integers no matter how we flip the cards, so we return 0.
```python
class Solution:
def flipgame(self, fronts: List[int], backs: List[int]) -> int:
same = {a for a, b in zip(fronts, backs) if a == b}
ans = 9999
for x in chain(fronts, backs):
if x not in same:
ans = min(ans, x)
return ans % 9999
s = {a for a, b in zip(fronts, backs) if a == b}
return min((x for x in chain(fronts, backs) if x not in s), default=0)
```

### **Java**
Expand Down Expand Up @@ -93,16 +89,22 @@ public:
int flipgame(vector<int>& fronts, vector<int>& backs) {
unordered_set<int> s;
int n = fronts.size();
for (int i = 0; i < n; ++i)
if (fronts[i] == backs[i])
for (int i = 0; i < n; ++i) {
if (fronts[i] == backs[i]) {
s.insert(fronts[i]);
}
}
int ans = 9999;
for (int& v : fronts)
if (!s.count(v))
for (int& v : fronts) {
if (!s.count(v)) {
ans = min(ans, v);
for (int& v : backs)
if (!s.count(v))
}
}
for (int& v : backs) {
if (!s.count(v)) {
ans = min(ans, v);
}
}
return ans % 9999;
}
};
Expand All @@ -112,20 +114,20 @@ public:

```go
func flipgame(fronts []int, backs []int) int {
s := map[int]bool{}
for i, v := range fronts {
if v == backs[i] {
s[v] = true
s := map[int]struct{}{}
for i, a := range fronts {
if a == backs[i] {
s[a] = struct{}{}
}
}
ans := 9999
for _, v := range fronts {
if !s[v] {
if _, ok := s[v]; !ok {
ans = min(ans, v)
}
}
for _, v := range backs {
if !s[v] {
if _, ok := s[v]; !ok {
ans = min(ans, v)
}
}
Expand All @@ -144,26 +146,52 @@ func min(a, b int) int {

```ts
function flipgame(fronts: number[], backs: number[]): number {
const s: Set<number> = new Set();
const n = fronts.length;
for (let i = 0; i < n; ++i) {
if (fronts[i] === backs[i]) {
s.add(fronts[i]);
}
}
let ans = 9999;
for (const v of fronts) {
if (!s.has(v)) {
ans = Math.min(ans, v);
}
}
for (const v of backs) {
if (!s.has(v)) {
ans = Math.min(ans, v);
}
}
return ans % 9999;
};
const s: Set<number> = new Set();
const n = fronts.length;
for (let i = 0; i < n; ++i) {
if (fronts[i] === backs[i]) {
s.add(fronts[i]);
}
}
let ans = 9999;
for (const v of fronts) {
if (!s.has(v)) {
ans = Math.min(ans, v);
}
}
for (const v of backs) {
if (!s.has(v)) {
ans = Math.min(ans, v);
}
}
return ans % 9999;
}
```

### **C#**

```cs
public class Solution {
public int Flipgame(int[] fronts, int[] backs) {
var s = new HashSet<int>();
int n = fronts.Length;
for (int i = 0; i < n; ++i) {
if (fronts[i] == backs[i]) {
s.Add(fronts[i]);
}
}
int ans = 9999;
for (int i = 0; i < n; ++i) {
if (!s.Contains(fronts[i])) {
ans = Math.Min(ans, fronts[i]);
}
if (!s.Contains(backs[i])) {
ans = Math.Min(ans, backs[i]);
}
}
return ans % 9999;
}
}
```

### **...**
Expand Down
40 changes: 23 additions & 17 deletions solution/0800-0899/0822.Card Flipping Game/Solution.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,18 +1,24 @@
class Solution {
public:
int flipgame(vector<int>& fronts, vector<int>& backs) {
unordered_set<int> s;
int n = fronts.size();
for (int i = 0; i < n; ++i)
if (fronts[i] == backs[i])
s.insert(fronts[i]);
int ans = 9999;
for (int& v : fronts)
if (!s.count(v))
ans = min(ans, v);
for (int& v : backs)
if (!s.count(v))
ans = min(ans, v);
return ans % 9999;
}
class Solution {
public:
int flipgame(vector<int>& fronts, vector<int>& backs) {
unordered_set<int> s;
int n = fronts.size();
for (int i = 0; i < n; ++i) {
if (fronts[i] == backs[i]) {
s.insert(fronts[i]);
}
}
int ans = 9999;
for (int& v : fronts) {
if (!s.count(v)) {
ans = min(ans, v);
}
}
for (int& v : backs) {
if (!s.count(v)) {
ans = min(ans, v);
}
}
return ans % 9999;
}
};
21 changes: 21 additions & 0 deletions solution/0800-0899/0822.Card Flipping Game/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
public class Solution {
public int Flipgame(int[] fronts, int[] backs) {
var s = new HashSet<int>();
int n = fronts.Length;
for (int i = 0; i < n; ++i) {
if (fronts[i] == backs[i]) {
s.Add(fronts[i]);
}
}
int ans = 9999;
for (int i = 0; i < n; ++i) {
if (!s.Contains(fronts[i])) {
ans = Math.Min(ans, fronts[i]);
}
if (!s.Contains(backs[i])) {
ans = Math.Min(ans, backs[i]);
}
}
return ans % 9999;
}
}
12 changes: 6 additions & 6 deletions solution/0800-0899/0822.Card Flipping Game/Solution.go
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,18 +1,18 @@
func flipgame(fronts []int, backs []int) int {
s := map[int]bool{}
for i, v := range fronts {
if v == backs[i] {
s[v] = true
s := map[int]struct{}{}
for i, a := range fronts {
if a == backs[i] {
s[a] = struct{}{}
}
}
ans := 9999
for _, v := range fronts {
if !s[v] {
if _, ok := s[v]; !ok {
ans = min(ans, v)
}
}
for _, v := range backs {
if !s[v] {
if _, ok := s[v]; !ok {
ans = min(ans, v)
}
}
Expand Down
Loading