Try getting the half, then reverse: >>> l=[1,2,3,4,5,6] >>> l[len(l)//2:]=l[len(l)//2:][::-1] >>> l [1, 2, 3, 6, 5, 4] >>> slicing + slicing + reversing. 1 solved How to divide the list and sort in ascending and descending order using python?
dotPoint = text.index(“.”) atPoint = text.index(“@”) firstPart = text[0:dotPoint] secondPart = text[dotPoint+1:atPoint] print firstPart print secondPart This will output bianca mary There you go. On Python 2.7 🙂 2 solved Slicing in Python, one part of string
Because r is an array of u8, you need to convert it to a valid &str and use push_str method of String. use std::str; fn main() { let rfrce = vec![&[65,66,67], &[68,69,70]]; let mut str = String::new(); for r in rfrce { str.push_str(str::from_utf8(r).unwrap()); } println!(“{}”, str); } Rust Playground 3 solved Proper way to access … Read more
The reason you see: %!(EXTRA uint8=10) is you are calling Printf without a format option. You should just call fmt.Println instead. 10 is the encoding of the newline character. Now, the meat of your question: You have a byte array (slice). You are trying to interpret it as lines (strings separated by ‘\n’). Interpreting a … Read more
I think you are misunderstanding the “:” notation for the lists. upper[:3] gives the first 3 characters from upper whereas upper[3:] gives you the whole list but the 3 first characters. In the end you end up with : upperNew = upper[:3] + upper[3:] = ‘ABC’ + ‘DEFGHIJKLMNOPQRSTUVWXYZ’ When you sum them into upperNew, you … Read more
I figured it out. string = ‘123456789’ splitted = [] prev = 0 while True: n = random.randint(1,3) splitted.append(string[prev:prev+n]) prev = prev + n if prev >= len(string)-1: break print splitted 0 solved Split string by n when n is random
This article will discuss how to split a string by a random number. Splitting a string is a common task in programming, and it can be done in many different ways. However, when the number used to split the string is random, it can be a bit more challenging. This article will provide an overview … Read more