-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathyyy.txt
122 lines (112 loc) · 2.12 KB
/
yyy.txt
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
<<<<<<< HEAD
//Wyszukiwanie palindromow w tekscie
//Rafal Swietlicki
//Implementacja w Java Tomasz Lubinski
//www.algorytm.org
public class Palindromy {
public static int f1(String s)
{kook
int i, j;
int n = s.length();
int wynik=n;
boolean m[][] = new boolean[n][n];
for(i=0;i<n-1;i++)
m[i+1][i]= true;
for(j=0;j<n;j++)
{
m[j][j]=true;
for(i=j-1;i>=0;i--)
{
m[i][j]=m[i+1][j-1] && s.charAt(i)==s.charAt(j);
if (m[i][j])
{
wynik++;
}
}
}
return wynik;
}
public static int f2(String s)
{
int n=s.length();
int T[][] = new int [n+1][n+1];
for(int i=0;i<n;i++)
{
T[i][i]=1;
for(int j=i-1;j>=0;j--)
{
T[j][i]=T[j+1][i]+1;
for(int k=j+1;k<=i;k++)
if(s.charAt(j)==s.charAt(k))
T[j][i]+=T[j+1][k-1]+1;
}
}
return T[0][n-1];
}
/**
* @param args
*/
public static void main(String[] args) {
String slowo;
System.out.println("Podaj slowo: ");
slowo = Console.readString();
System.out.println("Ilosc spojnych palindromow w slowie " + slowo + " wynosi " + f1(slowo));
System.out.println("Ilosc niespojnych palindromow w slowie " + slowo + " wynosi " + f2(slowo));
}
=======
//Wyszukiwanie palindromow w tekscie
//Rafal Swietlicki
//Implementacja w Java Tomasz Lubinski
//www.algorytm.org
public class Palindromy {
public static int f1(String s)
{
int i, j;
int n = s.length();
int wynik=n;
boolean m[][] = new boolean[n][n];
for(i=0;i<n-1;i++)
m[i+1][i]= true;
for(j=0;j<n;j++)
{
m[j][j]=true;
for(i=j-1;i>=0;i--)
{
m[i][j]=m[i+1][j-1] && s.charAt(i)==s.charAt(j);
if (m[i][j])
{
wynik++;
}
}
}
return wynik;
}
public static int f2(String s)
{
int n=s.length();
int T[][] = new int [n+1][n+1];
for(int i=0;i<n;i++)
{
T[i][i]=1;
for(int j=i-1;j>=0;j--)
{
T[j][i]=T[j+1][i]+1;
for(int k=j+1;k<=i;k++)
if(s.charAt(j)==s.charAt(k))
T[j][i]+=T[j+1][k-1]+1;
}
}
return T[0][n-1];
}
/**
* @param args
*/
public static void main(String[] args) {
String slowo;
System.out.println("Podaj slowo: ");
slowo = Console.readString();
System.out.println("Ilosc spojnych palindromow w slowie " + slowo + " wynosi " + f1(slowo));
System.out.println("Ilosc niespojnych palindromow w slowie " + slowo + " wynosi " + f2(slowo));
}
>>>>>>> be9f3070b137205a86b918468c046f88354e9fbe
}