For two reasons: The string meta data (e.g. length) is stored in the same memory block as the characters, to allow one string to use part of the character data of another string would mean that you would have to allocate two memory blocks for most strings instead of one. As most strings are not …
Multiple ways, a selection: str=abc.out Shell: echo ${str%.*} Grep: echo $str | grep -o ‘^[^\.]*’ Sed: echo $str | sed -E ‘s/(.*?)\..*/\1/’ Awk: echo $str | awk -F. ‘{print $1}’ -F. means split the string by . and $1 means the first column. Cut: echo $str | cut -d. -f1 All output: abc
The second parameter in Substring is the length of the substring, not the end index (in other words, it’s not the length of the full string). You should probably include handling to check that it does indeed start with what you expect, end with what you expect, and is at least as long as you …
The StringBuilder class has a special version of the ToString method that takes two arguments, exactly as Substring(startIndex, length). StringBuilder sb = new StringBuilder(“This is a Test”); string test = sb.ToString(10, 4); Console.WriteLine(test); // result = Test
new_str = str.slice(0..(str.index(‘blah’)))
Use strncpy e.g. strncpy(dest, src + beginIndex, endIndex – beginIndex); This assumes you’ve Validated that dest is large enough. endIndex is greater than beginIndex beginIndex is less than strlen(src) endIndex is less than strlen(src)
Why the c++’s implemented string::substr() doesn’t use the KMP algorithm (and doesn’t run in O(N + M)) and runs in O(N * M)? I assume you mean find(), rather than substr() which doesn’t need to search and should run in linear time (and only because it has to copy the result into a new string). …
You can capture the strings, then count them. It can be done by applying a list context to the capture with (): my $x = “foo”; my $y = “foo foo foo bar”; my $c = () = $y =~ /$x/g; # $c is now 3 You can also capture to an array and count …
To see more details including working code, check my blog post at: http://www.leetcode.com/2010/11/finding-minimum-window-in-s-which.html To help illustrate this approach, I use an example: string1 = “acbbaca” and string2 = “aba”. Here, we also use the term “window”, which means a contiguous block of characters from string1 (could be interchanged with the term substring). i) string1 = …
The only improvement I could think of is, to use list comprehension like this def get_all_substrings(input_string): length = len(input_string) return [input_string[i:j+1] for i in xrange(length) for j in xrange(i,length)] print get_all_substrings(‘abcde’) The timing comparison between, yours and mine def get_all_substrings(string): length = len(string) alist = [] for i in xrange(length): for j in xrange(i,length): alist.append(string[i:j …