JavaScript/strings_longest_polyndrome.js at master · chosenman/JavaScript · 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
var cString = "I did, did I, Madam I'm Adam, racecar"
function reverse(str){
	var reversed = '';
	for (var i = 0; i < str.length; i++) {
		reversed = str[i] + reversed;
	}
	return reversed
}

function superCleaner(str, min, max){
	var cleanString = "";
	var min = min || 97;
	var max = max || 122;
	for (var i = 0; i < str.length; i++) {
		if(str.charCodeAt(i) >= min && str.charCodeAt(i) <= max){
			cleanString += str[i];
		}
	}
	return cleanString;
}

function cleaner(str, min, max){
	var cleanString = "";
	var min = min || 97;
	var max = max || 122;
	for (var i = 0; i < str.length; i++) {
		if(str.charCodeAt(i) >= min && str.charCodeAt(i) <= max || str.charCodeAt(i) == 32){
			cleanString += str[i];
		}
	}
	return cleanString;
}

function iSearch(str) {
	var cleanString = cleaner(str.toLowerCase());
	// console.log(cleanString);
	var polSet = cleanString.split(" ");
	var longest = '';
	var longestReal = '';
	for (var i = 0; i < polSet.length; i++) {
		if( polSet[i] === cleaner(reverse(polSet[i])) ) {
			if(polSet[i].length > longest.length) {
				longest = polSet[i]
			}
		}
	}
	var checkingStr = '';
	var trueResult = str.split(" ");
	var candidateRam = '';
	for (var i = 0; i < polSet.length; i++) {
		for (var y = i+1; y < polSet.length; y++) {
			if (y == polSet.length){
				break;
			}
			if(polSet[i][0] == polSet[y][polSet[y].length-1]) {

				for (var x = i; x <= y; x++) {
					checkingStr += polSet[x];
					// console.log(checkingStr);
					candidateRam += trueResult[x] + " ";
					// console.log(candidateRam);
				}
				if( checkingStr === reverse(checkingStr) )  {
					if(checkingStr.length > longest.length) {
						longest = checkingStr;
						longestReal = candidateRam;
					}
				}
				checkingStr = '';
				candidateRam = '';
			}
		}
	}
	return longestReal
}


function longestPolyndrome(str) {
	var polSet = str.toLowerCase().split(" ");
	var longest = ""
	for (var i = 0; i < polSet.length; i++) {
		if( polSet[i] === cleaner(reverse(polSet[i])) ) {
			if(polSet[i].length > longest.length) {
				longest = polSet[i]
			}
		}
	}
	return longest
}


// console.log(longestPolyndrome('Racecar madamimadam maam') )
console.log(iSearch(cString) )