haha

Author: Jie Feng

SortOnPerm.class

@@ -0,0 +1,35 @@
+public class SortOnPerm {
+	public static void main(String[] arg){
+		int[] x = {0,3,5,1,4,2};//{0,17,5,1,9};
+		int[] a = {0,4,2,3,1,5};//{0,3,2,4,1};
+		
+		mergeSort(a,x,1,a.length-1);
+		for(int i=1;i<x.length;i++)
+			System.out.print(x[i]+" ");
+	}
+	
+	public static void mergeSort(int[] a,int[] x,int low,int high){
+		if(low>=high)
+			return;
+		int mid = (low+high)/2;
+		mergeSort(a,x,low,mid);
+		mergeSort(a,x,mid+1,high);
+		merge(a,x,low,mid,high);		
+	}
+	
+	public static void merge(int[] a,int[] x,int low,int mid ,int high){
+		for(int i=low,j=mid+1;i<=high&&j<=high;j++){
+			if(i<=high && j<=high){
+				if(a[j]<a[i]){
+					int tmp = x[i];
+					x[i] = x[j];
+					x[j] = tmp;
+					tmp = a[i];
+					a[i] =a[j];
+					a[j] = tmp;
+					i++;j--;
+				}
+			}
+		}
+	}
+}

SortOnPerm.java

@@ -0,0 +1,10 @@
+#include<iostream>
+using namespace std;
+
+int main(){
+    char a[4];
+    int *b = (int*)a;
+    *b = 1;
+    if (a[0]) cout << "Little Endian" << endl;
+    else cout << "Big Endian" << endl;
+}

algorithm-puzzle/endianness.cpp

@@ -0,0 +1,13 @@
+target= solution
+
+all:
+	#g++ -o $(target) -g $(target).cpp -w
+	g++ -o $(target) -g $(target).cpp -w -std=c++11
+
+.PHONY: run debug
+
+run:
+	./${target} 
+
+debug:
+	gdb ${target}

algorithm-puzzle/stuph.tar.gz

@@ -0,0 +1,121 @@
+#include<iostream>
+#include<ctime>
+#include<vector>
+#include<set>
+#include<string>
+#include<fstream>
+using namespace std;
+#define F(i,L,R) for (int i = L; i < R; i++)
+#define FE(i,L,R) for (int i = L; i <= R; i++)
+#define printA(a,L,R) FE(i,L,R) cout << a[i] << (i==R?'\n':' ')
+#define printM(a,n,m) F(i,0,n){ F(j,0,m) cout << a[i][j] << ' '; cout << endl;}
+#define printV(a) printA(a,0,a.size()-1);
+
+
+class Trie{
+public:
+    bool word;
+    Trie* next[26];
+    Trie(){
+        word = false;
+        for (int i = 0; i < 26; i++){
+            next[i] = NULL;
+        }
+    }
+    void insert(string& s, int p){
+        if (p == s.length()){
+            word = true;
+            return;
+        }
+
+        int i = s[p] - 'a';
+        if (next[i] == NULL)
+            next[i] = new Trie();
+        next[i]->insert(s, p+1);
+    }
+};
+
+class solution{
+private:
+    vector<string> words;
+    Trie* root;
+    string text;
+    int maxMatch;
+    double runTime;
+public:
+    solution(){
+        getText();
+        getWords();
+    }
+    void run10times(){
+        auto t1 = clock();
+        for (int i = 0; i < 10; i++){
+            buildTrie();
+            solve();
+        }
+        auto t2 = clock();
+        runTime = (t2-t1) * 1.0/ CLOCKS_PER_SEC;
+        output();
+    }
+    void output(){
+        cout << maxMatch << endl;
+        printf("Characters used: %d (%0.2f%%)\n", maxMatch, maxMatch*100.0/text.length());
+        cout << "Output:\n" << text << endl << endl << 
+            "Benchmarking.........." << endl;
+        printf("average time per run: %.4lf ms (10 runs, %.2lf ms total)\n", runTime/10, runTime);
+    }
+    void solve(){
+        vector<int> f(text.length()+1, 0), last(text.length()+1, -1);
+        int i = 0;
+        for (int i = 0; i < text.length(); i++){
+            Trie* cur = root;
+            int j = i;
+            while(j < text.length() && cur->next[text[j]-'a'] != NULL){
+                cur = cur->next[text[j]-'a'];
+                j++;
+                if (cur->word){
+                    if (f[i] + (j-i) > f[j]){
+                        f[j] = f[i] + j-i;
+                        last[j] = i;
+                    }
+                }
+            }
+        }
+        for (int i = 1; i <= text.length(); i++){
+            f[i] = f[i-1];
+            if (last[i] != -1) 
+                f[i] = max(f[last[i]] + i-last[i], f[i]);
+        }
+        i = text.length();
+        int miss = 0;
+        while(i >= 1){
+            if (f[i] == f[i-1]) text[i-1] = '-', i--, miss++;
+            else {
+                i = last[i];
+            }
+        }
+        maxMatch = text.length() - miss;
+    }
+    void getWords(){
+        ifstream fin("words.txt");
+        string s;
+        while(fin >> s){
+            words.push_back(s);
+        }
+    }
+    void buildTrie(){
+        root = new Trie();
+        for (int i = 0; i < words.size(); i++){
+            root->insert(words[i], 0);
+        }
+    }
+    void getText(){
+        ifstream fin("stuph.txt");
+        //ifstream fin("stuph_sample.txt");
+        fin >> text;
+    }
+};
+int main(){
+    solution s;
+    s.run10times();
+}

algorithm-puzzle/stuph/makefile

@@ -0,0 +1 @@
+AceAteTentEsth-Lop----Aer--IlaLesSicUplaArm-OmarGinDid-AbuPoly---Tost-OseLin---Pad-Dice-Den---Aby---

algorithm-puzzle/stuph/out

@@ -0,0 +1 @@
+aceatetentestholophwdgaerctilalessicuplaarmmomargindidrabupolycaitostioselinirtpadidicendenopiabynos