Berilgan so'zni satrdan topish (so'z satr bo’lagi emas)

O‘ZBEKISTON RESPUBLIKASI AXBOROT TEXNOLOGIYALARI VA KOMMUNIKATSIYALARINI RIVOJLANTIRISH VAZIRLIGI

MUHAMMAD AL-XORAZMIY NOMIDAGI

TOSHKENT AXBOROT TEXNOLOGIYALARI UNIVERSITETI

“Tizimli va amaliy dasturlashtirish” kafedrasi

“Algoritmlarni loyihalash”

fanidan

LABARATORIYA

TOPSHIRIQ №5

Bajardi:CAL004-L1-guruh talabasi

Abdurasulov Abdurahim

Qabul qildi: Atadjanova Charos Ravshanbekovna

Toshkent 2020
Satr bo’lagini izlash
TOPSHIRIQ:

Har qanday algoritm yordamida qator bo’lagi qidiruvini amalga oshirish (to'g'ridan-to'g'ri usul, Knuth, Morris va Pratt algoritmi)

Variant№1

Berilgan so'zni satrdan topish (so'z satr bo’lagi emas).

Ushbu dasturni ko’rib o’tamiz.
Dastur kodi:

package sample;
import java.util.Arrays;
import java.util.Scanner;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class Labaratoriya5
{ public static void main(String[] args) {
Scanner enter = new Scanner(System.in);
while (true){
System.out.println("Type 'finished' to complete");
System.out.println("Enter the word you want to find: ");
String enteredRegime = enter.nextLine();
if (enteredRegime.equals("finished")){
System.out.println("The program is complete");
System.exit(1);
}
System.out.println("Enter the text");
String enteredText = enter.nextLine();
char[] characters = new char[enteredText.length()];
int numberOfSimilarities = 0;

Pattern regime = Pattern.compile(enteredRegime);
Matcher similarity = regime.matcher(enteredText);
while (similarity.find()){
Arrays.fill(characters, similarity.start(), similarity.end(), '^');
numberOfSimilarities++;
}
if (numberOfSimilarities>0){
System.out.println(enteredText);
System.out.print(characters);
System.out.println();
System.out.println(+ numberOfSimilarities+" similarities were found");
} else
System.out.println("No similarity was found!!!");
} } }

Dastur ko’rinishi:




Endi ushbu dastur natijasini ko’ramiz.
Dastur natijasi: