The itertools module has a useful method called permutations(). The documentation says: itertools.permutations(iterable[, r]) Return successive r length permutations of elements in the iterable. If r is not specified or is None, then r defaults to the length of the iterable and all possible full-length permutations are generated. Permutations are emitted in lexicographic sort order. So, if … Read more
toCharArray followed by Arrays.sort followed by a String constructor call: EDIT: As tackline points out, this will fail if the string contains surrogate pairs or indeed composite characters (accent + e as separate chars) etc. At that point it gets a lot harder… hopefully you don’t need this 🙂 In addition, this is just ordering by ordinal, without … Read more
It’s compiling because printf isn’t type safe, since it uses variable arguments in the C sense1. printf has no option for std::string, only a C-style string. Using something else in place of what it expects definitely won’t give you the results you want. It’s actually undefined behaviour, so anything at all could happen. The easiest way to fix this, since … Read more
Check if string is nonnegative digit (integer) and alphabet You may use str.isdigit() and str.isalpha() to check whether a given string is a nonnegative integer (0 or greater) and alphabetical character, respectively. Sample Results: Check for strings as positive/negative – integer/float str.isdigit() returns False if the string is a negative number or a float number. For example: If you want to also check for the negative integers and float, then you may … Read more
I am trying to create an array of strings in C. If I use this code: gcc gives me “warning: assignment from incompatible pointer type”. What is the correct way to do this? edit: I am curious why this should give a compiler warning since if I do printf(a[1]);, it correctly prints “hmm”.
I have array with elements for example array = [“example1”, “example2”, “example3”]. I don’t know how to print in this format: 1. example1 2. example2 3. example 3…Any help?
Nevermind. Thought there might be a built in function. Wrote this instead:
This first removes all non-letter characters, folds to lowercase, then splits the input, doing all the work in a single line: Spaces are initially left in the input so the split will still work. By removing the rubbish characters before splitting, you avoid having to loop through the elements.
It’s in the standard library, and that’s the most straight forward way I can see to implement such a function. So yes, just loop through the string and convert each character to lowercase. Something trivial like this: or if you prefer one liners, then you can use this one by J.F. Sebastian:
Or, if the string already exists: Edit: I’m still not completely sure I understand the question. But if it’s something like what JoshG is suggesting, that you want up to length characters, or until a null terminator, whichever comes first, then you can use this: