Skip to content

Commit

Permalink
format
Browse files Browse the repository at this point in the history
  • Loading branch information
chechunchi committed Sep 23, 2024
1 parent cdd42c9 commit 57fab39
Show file tree
Hide file tree
Showing 2 changed files with 6 additions and 5 deletions.
9 changes: 5 additions & 4 deletions leetcode-cc/SearchA2dMatrixII.hpp
Original file line number Diff line number Diff line change
@@ -1,8 +1,9 @@
#include <utility>
#include <vector>

#include "TestHelper.h"
#include "problem.h"
#include "solution.h"
#include <utility>
#include <vector>

using namespace std;

Expand All @@ -13,7 +14,7 @@ IMPLEMENT_PROBLEM_CLASS(PSearchA2dMatrixII, 240, DIFFI_MEDIUM, TOPIC_ALGORITHMS,
{"Matrix"});

class SSearchA2dMatrixII : public ISolution {
public:
public:
size_t problemId() const override { return 240; }
string name() const override {
return ("Solution for " + string("Search a 2D Matrix II"));
Expand All @@ -33,7 +34,7 @@ class SSearchA2dMatrixII : public ISolution {
};
int benchmark() const override { return 0; }

private:
private:
bool searchMatrix(vector<vector<int>> &matrix, int target) const {
int m = matrix.size();
int n = matrix[0].size();
Expand Down
2 changes: 1 addition & 1 deletion runtime-cc/src/registration.cc
Original file line number Diff line number Diff line change
Expand Up @@ -117,6 +117,7 @@
#include "../leetcode-cc/RotateArray.hpp"
#include "../leetcode-cc/SameTree.hpp"
#include "../leetcode-cc/ScrambleString.hpp"
#include "../leetcode-cc/SearchA2dMatrixII.hpp"
#include "../leetcode-cc/SearchInRotaedSortedArray.hpp"
#include "../leetcode-cc/SetMismatch.hpp"
#include "../leetcode-cc/ShortestPalindrome.hpp"
Expand Down Expand Up @@ -149,7 +150,6 @@
#include "../leetcode-cc/WordSearchII.hpp"
#include "../leetcode-cc/WordsDataStructure.hpp"
#include "../leetcode-cc/ZeroOneMatrix.hpp"
#include "../leetcode-cc/SearchA2dMatrixII.hpp"

const int registerAll(std::shared_ptr<Container> handle) {
handle->registerProblem(
Expand Down

0 comments on commit 57fab39

Please sign in to comment.