Archives regulárny výraz - Stránka 3 z 3

Hackerrank – IP Address Validation

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie IP4 regex: \b(((2[0-5][0-5])|(1[0-9][0-9])|(\b[1-9][0-9]\b)|(\b\d\b))\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\b[1-9][0-9]\b)|(\b\d\b))\b IP6 regex: ([a-f0-9]{1,4}:){7}\b[0-9a-f]{1,4}\b Vytvoril som riešenie v týchto programovacích jazykoch: Java JavaScript Scala Ruby Všetky riešenia sú dostupné aj na mojom GitHub profile. Java

import java.util.*;

public class IPAddressValidation {

    private static final String IP6_PATTERN = "([a-f0-9]{1,4}:){7}\\b[0-9a-f]{1,4}\\b";
    private static final String IP4_PATTERN =
            "\\b(((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\b";

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int tests = Integer.parseInt(stdin.nextLine());
        for(int i = 0; i < tests; i++) {
            System.out.println(ipValidation(stdin.nextLine()));
        }
        stdin.close();
    }

    private static String ipValidation(String address) {
        if(address.matches(IP6_PATTERN))
            return "IPv6";
        else if(address.matches(IP4_PATTERN))
            return "IPv4";
        else
            return "Neither";
    }
}

import java.util.*;

public class IPAddressValidation {

private static final String IP6_PATTERN = "([a-f0-9]{1,4}:){7}\\b[0-9a-f]{1,4}\\b";

private static final String IP4_PATTERN =

"\\b(((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\b";

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int tests = Integer.parseInt(stdin.nextLine());

for(int i = 0; i < tests; i++) {

System.out.println(ipValidation(stdin.nextLine()));

}

stdin.close();

}

private static String ipValidation(String address) {

if(address.matches(IP6_PATTERN))

return "IPv6";

else if(address.matches(IP4_PATTERN))

return "IPv4";

else

return "Neither";

}

JavaScript

'use strict';

const IP6_PATTERN = "([a-f0-9]{1,4}:){7}\\b[0-9a-f]{1,4}\\b";
const IP4_PATTERN =
    "\\b(((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\b";

const processData = input => {
    let lines = input.split('\n').slice(1);
    let ipValidation = address => {
        if(address.match(new RegExp(IP4_PATTERN))) {
            return "IPv4";
        } else if(address.match(new RegExp(IP6_PATTERN))) {
            return "IPv6";
        } else {
            return "Neither";
        }
    };
    let validations = lines.map(ipValidation);
    console.log(validations.join('\n'));
};

process.stdin.resume();
process.stdin.setEncoding("ascii");

var _input = "";
process.stdin.on("data", input => _input += input);
process.stdin.on("end", () => processData(_input));

'use strict';

const IP6_PATTERN = "([a-f0-9]{1,4}:){7}\\b[0-9a-f]{1,4}\\b";

const IP4_PATTERN =

"\\b(((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\b";

const processData = input => {

let lines = input.split('\n').slice(1);

let ipValidation = address => {

if(address.match(new RegExp(IP4_PATTERN))) {

return "IPv4";

} else if(address.match(new RegExp(IP6_PATTERN))) {

return "IPv6";

} else {

return "Neither";

}

};

let validations = lines.map(ipValidation);

console.log(validations.join('\n'));

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

var _input = "";

process.stdin.on("data", input => _input += input);

process.stdin.on("end", () => processData(_input));

Scala

import scala.io.Source

object IPAddressValidation extends App {
  private[this] val IP6_PATTERN = "([a-f0-9]{1,4}:){7}\\b[0-9a-f]{1,4}\\b"
  private[this] val IP4_PATTERN =
    "\\b(((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\b"

  val lines = Source.stdin.getLines().drop(1)
  val validation = lines.map(ipValidation)
  println(validation.mkString("\n"))

  def ipValidation(address: String): String = {
    if(address.matches(IP6_PATTERN))
      "IPv6"
    else if(address.matches(IP4_PATTERN))
      "IPv4"
    else
      "Neither"
  }
}

import scala.io.Source

object IPAddressValidation extends App {

private[this] val IP6_PATTERN = "([a-f0-9]{1,4}:){7}\\b[0-9a-f]{1,4}\\b"

private[this] val IP4_PATTERN =

"\\b(((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\b"

val lines = Source.stdin.getLines().drop(1)

val validation = lines.map(ipValidation)

println(validation.mkString("\n"))

def ipValidation(address: String): String = {

if(address.matches(IP6_PATTERN))

"IPv6"

else if(address.matches(IP4_PATTERN))

"IPv4"

else

"Neither"

}

Ruby

tests = gets.chomp.to_i
tests.times do
  input = gets.chomp.to_s
  if input =~ /\b(((2[0-5][0-5])|(1[0-9][0-9])|(\b[1-9][0-9]\b)|(\b\d\b))\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\b[1-9][0-9]\b)|(\b\d\b))\b/
    puts "IPv4" 
  elsif input =~ /([a-f0-9]{1,4}:){7}\b[0-9a-f]{1,4}\b/
    puts "IPv6"
  else
    puts "Neither"
  end
end

tests = gets.chomp.to_i

tests.times do

input = gets.chomp.to_s

if input =~ /\b(((2[0-5][0-5])|(1[0-9][0-9])|(\b[1-9][0-9]\b)|(\b\d\b))\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\b[1-9][0-9]\b)|(\b\d\b))\b/

puts "IPv4"

elsif input =~ /([a-f0-9]{1,4}:){7}\b[0-9a-f]{1,4}\b/

puts "IPv6"

else

puts "Neither"

end

Hackerrank – HackerRank Tweets

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Skontrolovať, či každý riadok je validný pre nasledovný regulárny výraz. .*hackerrank.* Vytvoril som riešenie v týchto programovacích jazykoch: Java JavaScript Scala Ruby Všetky riešenia sú dostupné aj na mojom GitHub profile. Java

import java.util.*;

public class HackerrankTweets {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int tests = Integer.parseInt(stdin.nextLine());
        int count = 0;
        for(int i = 0; i < tests; i++) {
            if(stdin.nextLine().toLowerCase().matches(".*hackerrank.*")) {
                count++;
            }
        }
        System.out.println(count);
        stdin.close();
    }
}

import java.util.*;

public class HackerrankTweets {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int tests = Integer.parseInt(stdin.nextLine());

int count = 0;

for(int i = 0; i < tests; i++) {

if(stdin.nextLine().toLowerCase().matches(".*hackerrank.*")) {

count++;

}

System.out.println(count);

stdin.close();

}

JavaScript

'use strict';

const processData = input => {
    let lines = input.split('\n').slice(1);
    let matches = lines.filter(line => line.toLowerCase().match(/.*hackerrank.*/));
    console.log(matches.length);
};

process.stdin.resume();
process.stdin.setEncoding("ascii");

var _input = "";
process.stdin.on("data", input => _input += input);
process.stdin.on("end", () => processData(_input));

'use strict';

const processData = input => {

let lines = input.split('\n').slice(1);

let matches = lines.filter(line => line.toLowerCase().match(/.*hackerrank.*/));

console.log(matches.length);

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

var _input = "";

process.stdin.on("data", input => _input += input);

process.stdin.on("end", () => processData(_input));

Scala

import scala.io.Source

object HackerrankTweets extends App {
  val lines = Source.stdin.getLines().drop(1)
  val matchingLines = lines.count(_.toLowerCase.matches(".*hackerrank.*"))
  println(matchingLines)
}

import scala.io.Source

object HackerrankTweets extends App {

val lines = Source.stdin.getLines().drop(1)

val matchingLines = lines.count(_.toLowerCase.matches(".*hackerrank.*"))

println(matchingLines)

}

Ruby

tests = gets.chomp.to_i
result = 0
tests.times do
  words = gets.chomp.split
  words.each do |word|
    result += 1 if word.downcase =~ /.*hackerrank.*/
  end
end

puts result

tests = gets.chomp.to_i

result = 0

tests.times do

words = gets.chomp.split

words.each do |word|

result += 1 if word.downcase =~ /.*hackerrank.*/

end

puts result

Hackerrank – Find Hackerrank

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Vypíš „0“ ak zadaný reťazec zodpovedá regulárnemu výrazu ^hackerrank$ alebo ^hackerrank.*hackerrank$ Vypíš „1“ ak zadaný reťazec zodpovedá regulárnemu výrazu ^hackerrank.* Vypíš „2“ ak zadaný reťazec zodpovedá regulárnemu výrazu .*hackerrank$ inak vypíš „-1“ Vytvoril som riešenie v týchto programovacích jazykoch: Java JavaScript Scala Ruby Všetky riešenia […]

Hackerrank – Find a Substring

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Pre všetky riadky spočítaj výskyt tohto regulárneho výrazu: \w+{substring}\w+ Vytvoril som riešenie v týchto programovacích jazykoch: Java JavaScript Scala Ruby Všetky riešenia sú dostupné aj na mojom GitHub profile. Java

import java.util.*;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

public class FindSubstring {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int linesCount = Integer.parseInt(stdin.nextLine());
        String[] lines = new String[linesCount];
        for(int i = 0; i < linesCount; i++) {
            lines[i] = stdin.nextLine();
        }
        int substringCount = Integer.parseInt(stdin.nextLine());
        String[] substrings = new String[substringCount];
        for(int i = 0; i < substringCount; i++) {
            substrings[i] = stdin.nextLine();
        }
        for(int j = 0; j < substrings.length; j++) {
            int count = 0;
            String pattern = "\\w+" + substrings[j] + "\\w+";
            for(int i = 0; i < lines.length; i++) {
                String line = lines[i];
                Pattern p = Pattern.compile(pattern);
                Matcher m = p.matcher(line);
                while(m.find()) {
                    m.group();
                    count++;
                }
            }
            System.out.println(count);
        }
        stdin.close();
    }
}

import java.util.*;

import java.util.regex.Matcher;

import java.util.regex.Pattern;

public class FindSubstring {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int linesCount = Integer.parseInt(stdin.nextLine());

String[] lines = new String[linesCount];

for(int i = 0; i < linesCount; i++) {

lines[i] = stdin.nextLine();

}

int substringCount = Integer.parseInt(stdin.nextLine());

String[] substrings = new String[substringCount];

for(int i = 0; i < substringCount; i++) {

substrings[i] = stdin.nextLine();

}

for(int j = 0; j < substrings.length; j++) {

int count = 0;

String pattern = "\\w+" + substrings[j] + "\\w+";

for(int i = 0; i < lines.length; i++) {

String line = lines[i];

Pattern p = Pattern.compile(pattern);

Matcher m = p.matcher(line);

while(m.find()) {

m.group();

count++;

}

System.out.println(count);

}

stdin.close();

}

JavaScript

'use strict';

const processData = input => {
    let inputLines = input.split('\n');
    let linesLength = parseInt(inputLines[0]);
    let substrings = inputLines.slice(linesLength + 2);
    for(let j = 0; j < substrings.length; j++) {
        let count = 0;
        let pattern = "\\w+" + substrings[j] + "\\w+";
        for(let i = 1; i <= linesLength; i++) {
            let line = inputLines[i];
            let match = line.match(new RegExp(pattern, "g"));
            count += match ? match.length : 0;
        }
        console.log(count);
    }
};

process.stdin.resume();
process.stdin.setEncoding("ascii");

var _input = "";
process.stdin.on("data", input => _input += input);
process.stdin.on("end", () => processData(_input));

'use strict';

const processData = input => {

let inputLines = input.split('\n');

let linesLength = parseInt(inputLines[0]);

let substrings = inputLines.slice(linesLength + 2);

for(let j = 0; j < substrings.length; j++) {

let count = 0;

let pattern = "\\w+" + substrings[j] + "\\w+";

for(let i = 1; i <= linesLength; i++) {

let line = inputLines[i];

let match = line.match(new RegExp(pattern, "g"));

count += match ? match.length : 0;

}

console.log(count);

}

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

var _input = "";

process.stdin.on("data", input => _input += input);

process.stdin.on("end", () => processData(_input));

Scala

import scala.io.Source

object FindSubstring extends App {
  val inputLines = Source.stdin.getLines().toList
  val linesLength = inputLines(0).toInt
  val lines = inputLines.slice(1, linesLength + 1)
  val substrings = inputLines.slice(linesLength + 2, inputLines.length)
  val counts = substrings.map(findSubstring(lines, _))
  println(counts.mkString("\n"))


  def findSubstring(lines: List[String], substring: String): Int = {
    lines.map(line => {
      val pattern = "\\w+" + substring + "\\w+"
      val matches = pattern.r.findAllMatchIn(line)
      matches.length
    }).sum
  }
}

import scala.io.Source

object FindSubstring extends App {

val inputLines = Source.stdin.getLines().toList

val linesLength = inputLines(0).toInt

val lines = inputLines.slice(1, linesLength + 1)

val substrings = inputLines.slice(linesLength + 2, inputLines.length)

val counts = substrings.map(findSubstring(lines, _))

println(counts.mkString("\n"))

def findSubstring(lines: List[String], substring: String): Int = {

lines.map(line => {

val pattern = "\\w+" + substring + "\\w+"

val matches = pattern.r.findAllMatchIn(line)

matches.length

}).sum

}

Ruby

lines_count = gets.chomp.to_i
words = []
lines_count.times do
  line = gets.chomp
  w = line.split
  w.each { |a| words << a}
end

pattern_count = gets.chomp.to_i
pattern_count.times do
  input = gets.chomp
  pattern = "[a-z_]+#{input}[a-z_]+"
  result = 0
  words.each do |word|
    if word =~ /\w+#{input}\w+/
      result += 1 
    end
  end
  puts result
end

lines_count = gets.chomp.to_i

words = []

lines_count.times do

line = gets.chomp

w = line.split

w.each { |a| words << a}

end

pattern_count = gets.chomp.to_i

pattern_count.times do

input = gets.chomp

pattern = "[a-z_]+#{input}[a-z_]+"

result = 0

words.each do |word|

if word =~ /\w+#{input}\w+/

result += 1

end

puts result

end

Hackerrank – Detecting Valid Latitude and Longitude Pairs

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Môj regulárny výraz: $[+-]?((90(\.0+)?)|([1-8][0-9](\.[0-9]+)?)|([0-9](\.[0-9]+)?)),\s*[+-]?(((([1-9][0-9])|([0-9]))(\.[0-9]+)?)|(1((80(\.0+)?)|([0-7][0-9](\.[0-9]+)?))))$ Všetky riešenia sú dostupné aj na mojom GitHub profile.

Hackerrank – Detect HTML Tags

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Regex pre všetky tagy

Hackerrank – Detect HTML Attributes

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Vyparsuj všetky tagy, ktoré majú atribúty. Potom vyparsuj iba tagy a iba atribúty. Usporiadaj atribúty podľa toho, v akom tagu sa nachádzajú. Nakoniec už len usporiadať tagy a potom atribúty a vypísať výsledok. Vytvoril som riešenie v týchto programovacích jazykoch: Java Scala Všetky riešenia sú […]

Hackerrank – Alien Username

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Takýto regulárny výraz overí platnosť prihlasovacieho mena: ^[_\.]\d+[a-zA-Z]*_?$ Vytvoril som riešenie v týchto programovacích jazykoch: Java JavaScript Scala Ruby Všetky riešenia sú dostupné aj na mojom GitHub profile. Java

import java.util.Scanner;

public class AlienUsername
{
    public static void main(String[] args)
    {
        Scanner scanner = new Scanner(System.in);
        int testCases = scanner.nextInt();
        for (int i = 0; i < testCases; i++)
        {
            String input = scanner.next();
            if(input.matches("[_\\.]\\d+[a-zA-Z]*_?"))
            {
                System.out.println("VALID");
            }
            else
            {
                System.out.println("INVALID");
            }
        }
        scanner.close();
    }
}

import java.util.Scanner;

public class AlienUsername

{

public static void main(String[] args)

{

Scanner scanner = new Scanner(System.in);

int testCases = scanner.nextInt();

for (int i = 0; i < testCases; i++)

{

String input = scanner.next();

if(input.matches("[_\\.]\\d+[a-zA-Z]*_?"))

{

System.out.println("VALID");

}

else

{

System.out.println("INVALID");

}

scanner.close();

}

JavaScript

function processData(input) {
    var lines = input.split("\n");
    for(var i = 1; i < lines.length; i++) {
        if(lines[i].match(/^[_\.]\d+[a-z]*_?$/ig)) {
            console.log("VALID");
        } else {
            console.log("INVALID");
        }
    }
}

process.stdin.resume();
process.stdin.setEncoding("ascii");
_input = "";
process.stdin.on("data", function (input) {
    _input += input;
});

process.stdin.on("end", function () {
    processData(_input);
});

function processData(input) {

var lines = input.split("\n");

for(var i = 1; i < lines.length; i++) {

if(lines[i].match(/^[_\.]\d+[a-z]*_?$/ig)) {

console.log("VALID");

} else {

console.log("INVALID");

}

process.stdin.resume();

process.stdin.setEncoding("ascii");

_input = "";

process.stdin.on("data", function (input) {

_input += input;

});

process.stdin.on("end", function () {

processData(_input);

});

Scala

import scala.io.Source

object AlienUsername extends App {
  val usernames = Source.stdin.getLines().drop(1)

  println(usernames.map(validateUsername).mkString("\n"))

  def validateUsername(name: String): String = {
    if (name.matches("[_\\.]\\d+[a-zA-Z]*_?"))
      return "VALID"
    else
      return "INVALID"
  }
}

import scala.io.Source

object AlienUsername extends App {

val usernames = Source.stdin.getLines().drop(1)

println(usernames.map(validateUsername).mkString("\n"))

def validateUsername(name: String): String = {

if (name.matches("[_\\.]\\d+[a-zA-Z]*_?"))

return "VALID"

else

return "INVALID"

}

Ruby

n = gets.to_i
n.times do
  name = gets.to_s.strip
  if /[_\.]\d+[a-zA-Z]*_?/ =~ name
    puts "VALID"
  else
    puts "INVALID"
  end
end

n = gets.to_i

n.times do

name = gets.to_s.strip

if /[_\.]\d+[a-zA-Z]*_?/ =~ name

puts "VALID"

else

puts "INVALID"

end

Pavol Pidanič

Dokážem na 10 prstoch napočítať do 1023

Značka: regulárny výraz

Hackerrank – IP Address Validation

Hackerrank – HackerRank Tweets

Hackerrank – Find Hackerrank

Hackerrank – Find a Substring

Hackerrank – Detecting Valid Latitude and Longitude Pairs

Hackerrank – Detect HTML Tags

Hackerrank – Detect HTML Attributes

Hackerrank – Alien Username