Refactor de least_count

pauek · Dec 30, 2012 · 48cabc5 · 48cabc5
1 parent c4c87f9
commit 48cabc5
Show file tree

Hide file tree

Showing 2 changed files with 6 additions and 12 deletions.
diff --git a/sudoku.en.cc b/sudoku.en.cc
@@ -139,12 +139,9 @@ bool Sudoku::eliminate(int k, int val) {
 int Sudoku::least_count() const {
    int k = -1, min;
    for (int i = 0; i < _cells.size(); i++) {
-      int m = _cells[i].count();
-      if (m > 1) {
-         if (k == -1 || m < min) {
-            min = m;
-            k = i;
-         }
+      const int m = _cells[i].count();
+      if (m > 1 && (k == -1 || m < min)) {
+         min = m, k = i;
       }
    }
    return k;

diff --git a/sudoku.es.cc b/sudoku.es.cc
@@ -138,12 +138,9 @@ bool Sudoku::elimina(int k, int val) {
 int Sudoku::menos_posibilidades() const {
    int k = -1, min;
    for (int i = 0; i < _celdas.size(); i++) {
-      int m = _celdas[i].num_activos();
-      if (m > 1) {
-         if (k == -1 || m < min) {
-            min = m;
-            k = i;
-         }
+      const int m = _celdas[i].num_activos();
+      if (m > 1 && (k == -1 || m < min)) {
+         min = m, k = i;
       }
    }
    return k;