Sequence/Sequence.cpp at master · Cinkye/Sequence · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
#include "Sequence.h"
#include <fstream>
#include <iomanip>
#include <string>
#include <stdlib.h>
#include <string.h>

Sequence::Sequence(const char* a)
    {
        file.open(a);
        if(!file)
            {
            cerr << "File could not be opened." << endl;
            }
        read();
    }

Sequence::~Sequence()
    {
        file.close();
    }

int Sequence::length()
    {
        return s.length();
    }

int Sequence::numberOf(char base)
    {
        int count=0;
        string tmp = s;
        for(int i = 0;i < s.length();++i)
	    {
            if(base==s[i])
	    count++;
	    }
	    return count;
    }

void Sequence::read()
    {
        char * buf = new char[1000];
	while(!file.eof())
	    {
	    file.getline(buf,1000);
	    s = s + buf;
	    }
	    //    cout << s;
    }
/*
string Sequence::longestConsecutive()
    {
        string longest;
        string current;
        char base;
        string tmp = s;
        base = s[0];
        longest = base;
        for(int i = 1;i < s.length();++i)
        {
        if(current.length()>longest.length())
	longest = current;
	if(base == s[i])
	current = current + s[i];
	else
	{
	base = s[i];
	current = s[i];
	}

        }
	return longest;
    }
*/
//Another method of longestConsecutive()

string Sequence::longestConsecutive()
    {
        string longest;
	longest.clear();
	char max='Q';
	char base='Q';
	long long slength = s.length();
	int count=0;
	int mcount=0;
	for(int i = 0;i < slength;++i)
	{
	if(base == s[i])
	count++;
	else
	{
	if(count>mcount)
	{
	max = base;
	mcount = count;
	}
	base = s[i];
	count = 1;
	}
	}
	for(int i = 0;i < mcount;++i)
	{
	longest = longest + max;
	}
	cout << mcount <<endl;
	return longest;
    }

int pstrcmp(const void* p1, const void* p2)
{
	return strcmp(*(const char**)p1, *(const char**)p2);
}

int commonLength(char*p, char*q)
	{
	    int i = 0;
	    while(p[i] == q[i++]);
	    return --i;
	}

//Variables used in the following function
char c[1500000];
char* cPtr[1500000];

string Sequence::longestRepeated()
{
        int slength = s.length();
	int max = 0;
	int point = 0;
	for(int i = 0;i<slength;++i)
	{
	    cPtr[i] = &c[i];
	    c[i] = s[i];
        }
	c[slength] = 0;
	qsort(cPtr,slength,sizeof(char*),pstrcmp);
	for(int i = 0;i<slength-1;++i)
	{
	    if(commonLength(cPtr[i],cPtr[i+1]) > max)
	    {
	        max = commonLength(cPtr[i],cPtr[i+1]);
		point = i;
	    }
	}
	string out;
	out.assign(cPtr[point],max);
	return out;
	}