LeetCode Valid Sudoku

本文讨论了如何根据数独规则验证给定数独的有效性,包括行、列和子区域的检查。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

题目:

Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.

The Sudoku board could be partially filled, where empty cells are filled with the character '.'.


A partially filled sudoku which is valid.

Note:
A valid Sudoku board (partially filled) is not necessarily solvable. Only the filled cells need to be validated.

class Solution {
public:
	bool isValidSudoku(vector<vector<char> > &board) {
		return isValidRow(board) && isValidCol(board) && isValidSub(board);
	}
private:
	bool isValidRow(vector<vector<char>> &a) {
		for (int i = 0; i < 9; i++) {
			int tmp[255] = { 0 };
			for (int j = 0; j < 9; j++)
				tmp[a[i][j]]++;
			for (int k = '0'; k <= '9'; k++) {
				if (tmp[k] >1)
					return false;
			}
		}
		return true;
	}
	bool isValidCol(vector<vector<char>> &a) {
		for (int j = 0; j < 9; j++) {
			int tmp[255] = { 0 };
			for (int i = 0; i < 9; i++)
				tmp[a[i][j]]++;
			for (int k = '0'; k <= '9'; k++) {
				if (tmp[k] > 1)
					return false;
			}
		}
		return true;
	}
	bool isValidSub(vector<vector<char>> &a) {
		for (int i = 0; i < 9; i += 3) {
			for (int j = 0; j < 7; j += 3) {
				int tmp[255] = { 0 };
				for (int m = 0; m < 3; m++) {
					for (int n = 0; n < 3; n++)
						tmp[a[i + m][j + n]]++;
				}
				for (int k = '0'; k <= '9'; k++) {
					if (tmp[k] > 1)
						return false;
				}
			}
		}
		return true;
	}
};



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值