fwang49asu

commit 9d5cea1417cc2bc6918cb58b87ed92c6f95ea6c6
Author: Feng Wang <fwang49@asu.edu>
Date:   Thu Sep 8 11:42:44 2016 -0700

    update to 1.1.0

diff --git a/PKGBUILD b/PKGBUILD
index c0d677f..b18dc32 100644
--- a/PKGBUILD
+++ b/PKGBUILD

fwang49asu

class Solution {
private:
  string compare(string& a, string& b) {
    int n = min(a.length(), b.length());
    for (int i = 0; i < n; ++i) {
      if (a[i] != b[i]) {
        string result = "";
        result.push_back(a[i]);
        result.push_back(b[i]);
        return result;

fwang49asu

class Solution {
private:
  string compare(string& a, string& b) {
    int n = min(a.length(), b.length());
    for (int i = 0; i < n; ++i) {
      if (a[i] != b[i]) {
        return {a[i], b[i]};
      }
    }
    return "";

fwang49asu

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>

using namespace std;

class Ordering {
private:
  bool toposort(string& dict, vector<string>& graph, vector<int>& indegrees, string& cache) {

fwang49asu

class Solution {
private:
  struct State {
    string key;
    vector<int> board;
    vector<int> indices;
  };
  
  string encode(vector<int>& vec) {
    string result = "";

fwang49asu

class Solution {
private:
  struct State {
    string key;
    vector<int> board;
    vector<int> indices;
  };
  
  string encode(vector<int>& vec) {
    string result = "";

fwang49asu

#include <iostream>
#include <vector>
#include <unordered_map>
#include <queue>
#include <algorithm>

using namespace std;

struct State {
  int key;

fwang49asu

#include <iostream>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <algorithm>

using namespace std;

struct State {

fwang49asu

#include <iostream>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <algorithm>
#include <sstream>

using namespace std;

fwang49asu

#include <iostream>
#include <vector>
using namespace std;

class SlidingPuzzle {
private:
  int inversions(vector<int>& board) {
    int result = 0;
    for (int i = 0; i < board.size(); ++i) {
      for (int k = i + 1; k < board.size(); ++k) {