const std::vector more_words { "this is a sentence.", "this is also words "another line in one", "stuff words in open", "stuff words in OPEN", "whitespace\n\tagain }; ASSERT_EQ(CloseEnough(more_words, 5), 3); /* Index 3: "stuff words in open" is only distance 4 fron the next string Index 4: "stuff words in OPEN", so the function returns 3 */ ASSERT_EQ(CloseEnough(more_words, ®), -1); // No index is within e distance of the next string.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

C++

I'm interested in knowing if there are two adjacent strings in a list that are very similar to each other. For instance, "Zach" and "Zack" are only one character apart.

Write a function, named "CloseEnough" that takes a const reference to a vector of strings and an int. The vector is a list of strings (each of the same length). The int represents how many characters can be different between any two strings next to each other. This function should return the index (an int) of the string that is within the second arguments distance to the next string in the vector. If no index fulfills this criteria, it should return -1.

You should be using the STL algorithms to achieve this and no while or for loops.

const std::vector<std::string> more_words {
"this is a sentence.",
"this is also words ",
"another line in one",
"stuff words in open",
"stuff words in OPEN",
"whitespace\n\tagain
};
ASSERT_EQ(CloseEnough(more_words, 5), 3);
/*
Index 3: "stuff words in open"
is only distance 4 fron the next string
Index 4: "stuff words in OPEN",
so the function returns 3
*/
ASSERT_EQ(CloseEnough(more_words, 0), -1);
// No index is within 0 distance of the next string.
Transcribed Image Text:const std::vector<std::string> more_words { "this is a sentence.", "this is also words ", "another line in one", "stuff words in open", "stuff words in OPEN", "whitespace\n\tagain }; ASSERT_EQ(CloseEnough(more_words, 5), 3); /* Index 3: "stuff words in open" is only distance 4 fron the next string Index 4: "stuff words in OPEN", so the function returns 3 */ ASSERT_EQ(CloseEnough(more_words, 0), -1); // No index is within 0 distance of the next string.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Linked List Representation
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education