nullptr/Leetcode
Template
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Optimize

Browse Source
This commit is contained in:
Electrominch
2022-10-07 01:16:42 +03:00
parent e711e64e07
commit 62104da8f1
1 changed files with 9 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
36. Valid Sudoku/Solution.cs
View File

@@ -12,14 +12,13 @@ public class Solution
foreach (char[] row in board) foreach (char[] row in board)
{ {
HashSet<char> rowSet = new HashSet<char>(); HashSet<char> rowSet = new HashSet<char>();
foreach (char c in row) foreach (char ch in row)
{ {
if (c != '.') if (ch != '.')
{ {
int prevCount = rowSet.Count; if (rowSet.Contains(ch))
rowSet.Add(c);
if (prevCount == rowSet.Count)
return false; return false;
rowSet.Add(ch);
} }
} }
} }
@@ -30,16 +29,15 @@ public class Solution
{ {
for (int columnIndex = 0; columnIndex < board[0].Length; columnIndex++) for (int columnIndex = 0; columnIndex < board[0].Length; columnIndex++)
{ {
HashSet<char> column = new HashSet<char>(); HashSet<char> columnSet = new HashSet<char>();
for (int rowIndex = 0; rowIndex < board[columnIndex].Length; rowIndex++) for (int rowIndex = 0; rowIndex < board[columnIndex].Length; rowIndex++)
{ {
char ch = board[rowIndex][columnIndex]; char ch = board[rowIndex][columnIndex];
if (ch != '.') if (ch != '.')
{ {
int prevCount = column.Count; if (columnSet.Contains(ch))
column.Add(ch);
if (prevCount == column.Count)
return false; return false;
columnSet.Add(ch);
} }
} }
} }
@@ -68,10 +66,9 @@ public class Solution
char ch = board[y][x]; char ch = board[y][x];
if (ch != '.') if (ch != '.')
{ {
int prev = set.Count; if (set.Contains(ch))
set.Add(ch);
if (prev == set.Count)
return false; return false;
set.Add(ch);
} }
} }
} }