Extracting Port Number from a localhost API Request to a Server using Regular Expressions
Last Updated : 14 Mar, 2023
Given a String test_str as localhost API Request Address, the task is to get the extract port number of the service.
Examples:
Input: test_str = ‘http://localhost:8109/users/addUsers’
Output: 8109
Explanation: Port Number, 8109 extracted.
Input: test_str = ‘http://localhost:1337/api/products’
Output: 1337
Explanation: Port Number, 1337 extracted.
Approach: The problem can be solved based on the following idea:
Create a regex pattern to validate the number as written below:
regex = “[:]{1}[0-9]{4, }“
Where,
- [:]: This pattern will match if one of the preceding is a colon character
- [0-9]{4} : This pattern will allow 4 or more than 4 preceding elements if they are digits.
Follow the below steps to implement the idea:
- Create a regex expression to extract all the Port numbers from the string.
- Use Pattern class to compile the regex formed.
- Use the matcher function to find.
Below is the code implementation of the above-discussed approach:
C++ // C++ code for the above approach: #include <bits/stdc++.h> #include <regex> using namespace std; // Function to extract the port // Number from a given string void extractPortNumber(string str) { // You can Add n number of API and // its format to extract port // Number formats in the below // given String Array. string strPattern[] = { "[:]{1}[0-9]{4}" }; for (int i = 0; i < 1; i++) { regex pattern(strPattern[i]); smatch matcher; if (regex_search(str, matcher, pattern)) { cout << matcher.str().substr(1) << endl; } } } // Driver Code int main() { // String containing the // API Request string str = "http://localhost:8082/api/secure"; cout << "Given String is:\n" << str << endl; cout << "Above Given API is running on Port Number:\n"; extractPortNumber(str); return 0; } // This Code is Contributed by Prasad Kandekar(prasad264)
Java // Java code for the above approach import java.io.*; import java.util.regex.Matcher; import java.util.regex.Pattern; public class GFG { // Driver Code public static void main(String[] args) { // String containing the // API Request String str = "http:/" + "/localhost:8082/api/secure"; System.out.println("Given String is:\n" + str); System.out.println( "Above Given API is running on Port Number:"); extractPortNumber(str); } // Function to extract the port // Number from a given string static void extractPortNumber(String str) { // You can Add n number of API and // its format to extract port // Number formats in the below // given String Array. String strPattern[] = { "[:]{1}[0-9]{4}" }; for (int i = 0; i < strPattern.length; i++) { Pattern pattern = Pattern.compile(strPattern[i]); Matcher matcher = pattern.matcher(str); while (matcher.find()) { System.out.println( matcher.group().replace(":", "")); } } } }
C# using System; using System.Text.RegularExpressions; class GFG { static void Main(string[] args) { // String containing the // API Request string str = "http:/" + "/localhost:8082/api/secure"; Console.WriteLine("Given String is:\n" + str); Console.WriteLine( "Above Given API is running on Port Number:"); ExtractPortNumber(str); } static void ExtractPortNumber(string str) { // You can Add n number of API and // its format to extract port // Number formats in the below // given String Array. string[] strPattern = { "[:]{1}[0-9]{4}" }; for (int i = 0; i < strPattern.Length; i++) { Regex pattern = new Regex(strPattern[i]); MatchCollection matches = pattern.Matches(str); foreach(Match match in matches) { Console.WriteLine( match.Value.Replace(":", "")); } } } }
Python3 import re # Function to extract the port number from a given string def extractPortNumber(str): # You can add n number of API and its format to extract port # number formats in the below given String Array. strPattern = [r"[:]{1}[0-9]{4}"] for pattern in strPattern: matches = re.findall(pattern, str) for match in matches: print(match.replace(":", "")) # Driver code if __name__ == "__main__": # String containing the API request str = "http://localhost:8082/api/secure" print("Given String is:\n" + str) print("Above Given API is running on Port Number:") extractPortNumber(str)
JavaScript // Function to extract the port // Number from a given string function extractPortNumber(str) { // You can Add n number of API and // its format to extract port // Number formats in the below // given String Array. const strPattern = [ /[:]{1}[0-9]{4}/ ]; for (let i = 0; i < 1; i++) { const pattern = strPattern[i]; const matcher = str.match(pattern); if (matcher) { console.log(matcher[0].substr(1)); } } } // Driver Code const str = "http://localhost:8082/api/secure"; console.log("Given String is:\n" + str); console.log("Above Given API is running on Port Number:\n"); extractPortNumber(str);
OutputGiven String is: http://localhost:8082/api/secure Above Given API is running on Port Number: 8082
Complexity :
The time complexity of the above code depends on the size of the input string and the number of patterns in the strPattern array. Since the for loop only iterates once over the strPattern array, the time complexity is O(n), where n is the size of the input string. This is because the regular expression matching operation takes O(n) time in the worst case for an input string of size n.
The space complexity of the above code is also O(n) because it only stores the input string and the regular expression pattern in memory, both of which have a size proportional to n. Additionally, the matcher object created by regex_search has a space complexity that is dependent on the size of the input string, but since it is only used to extract the port number and not stored, it does not contribute to the overall space complexity.
Related Articles:
Similar Reads
DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on
7 min read
Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s
12 min read
Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge
14 min read
Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st
2 min read
Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir
8 min read
Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta
15+ min read
Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc
15 min read
Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T
9 min read
Array Data Structure Guide In this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
4 min read
Sorting Algorithms A Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read