Skip to main content

String class in C++

In C++, another way of representing an array of characters is using Strings class. Using string class gives many advantages over Character array like:
  • The size of the array has to be predefined if it is getting allocated statically(char arr[3]). In this case, there might be unused bytes which results in inefficient memory usage. But, in string class size won't be wasted as memory is allocated on need basis.
  • There is a possibility of array decay in an array of characters(Array decay happens usually when an array of characters is passed as by the value of reference and the type or dimension is changed). Whereas in string class such problems don't arise as it uses objects.
  • Characters array doesn't provide many inbuilt functions to handle operations on strings. Whereas in the string there are many inbuilt functions to do operations.
Some of the built-in APIs provided by string class are:
  1. getline(cin, str): It is used to take input from the string. cin is also to take input of a set of characters but, it will stop accepting characters after space. getline() captures input until enter is recognized.
  2. str.push_back('z'): It concatenates the 'z' character at the end of the string str.
  3. str.pop_back(): It removes the last character from the string.
  4. capacity(): It returns the size of the memory allocated. It can be greater than the size of the characters so that if new characters are being inserted, it will be efficient.
  5. resize(): It changes the size of a string. With this, the size of the string can be increased or decreased based on the size given.
  6. length(): It returns the size of the string(doesn't include null character).
  7. shrink_to_fit(): As already discussed, the capacity of the string can be more than what is the actual size of the string. In order to shrink it so that the extra space is removed shrink_to_fit() is used.
  8. begin(): It returns the beginning pointer of the string
  9. end(): It returns the end pointer of the string.
  10. rbegin(): It returns the reverse iterator pointing at the end of the string.
  11. rend(): It returns the reverse iterator pointing at the start of the string.
  12. copy("character array", length, position): It copies the string into character array of size as length and starting position as position.
  13.  swap(): It swap the two string.

Comments

Popular posts from this blog

Leet Code: Problem #710 Random Pick with Blacklist

Given a blacklist  B containing unique integers from [0, N) , write a function to return a uniform random integer from [0, N) which is NOT  in B . Optimize it such that it minimizes the call to system’s Math.random() . Note: 1 <= N <= 1000000000 0 <= B.length < min(100000, N) [0, N)  does NOT include N. See interval notation . Example 1: Input: ["Solution","pick","pick","pick"] [[1,[]],[],[],[]] Output: [null,0,0,0] Example 2: Input: ["Solution","pick","pick","pick"] [[2,[]],[],[],[]] Output: [null,1,1,1] Example 3: Input: ["Solution","pick","pick","pick"] [[3,[1]],[],[],[]] Output: [null,0,0,2] Example 4: Input: ["Solution","pick","pick","pick"] [[4,[2]],[],[],[]] Output: [null,1,3,1] Explanation of Input Syntax: The input is two lists: the subroutines called and their argume...

Leet Code: Problem: 355. Design Twitter

Problem Statement: Design basic twitter which lets user follow and unfollow other users and show the latest new feed related to the current user and the user followers. Implement the following APIs void postTweet(int userId, int tweetId):     Stores the tweetId against the user ID. void follow(int followerId, int followeeId):     Marks that follower ID as following followee ID void unfollow(int followerId, int followeeId):     Marks that follower ID as unfollowing followee ID vector<int> getNewsFeed(int userId):     Returns the set of the latest 10 tweetIDs which include the current user tweetIDs and tweetIDs of the user that the follower if following. Approach to the problem: First we need to store the user IDs of the people a particular user is following To store that we can use map. To optimize things instead of storing list of followers, it is better to store them in a set for quicker access. So the followers data str...

LeetCode: Problem #1402. Reducing Dishes

Problem Statement: A chef has collected the data on the review for his dishes. Our Chef will take just 1 unit of time to prepare a dish. Our job is to tell him the dishes he has to make in the order to achieve maximum benefit. The maximum benefit is calculated using the formula time[i] * (review ratings). Example 1: Input: reviews = [-1, -10, -9, 0, 5] Output: 14 Explanation: Considering the dishes in the order of -1, 0 ,5 the calculation will be (-1 * 1 + 0 * 2 + 5 * 3) = 14 Example 2: Input: reviews = [6,5,4] Output: 32 Explanation: Considering the dishes in the order of 4, 5, 6 the calculation will be (4 * 1 + 5 * 2 + 6 * 3) = 32 Approach to the solution: Sort the given reviews so that we can concentrate only on maximum benefited reviews. Make cumulative sums from the end. This will help in deciding till which we have to consider the summation. Now start from the end at add the previous array of cumulative sums until a negative number is encountered. We have to iterate in reverse or...