Created
March 21, 2016 23:38
-
-
Save dumpmycode/b341f59630979d1f13e9 to your computer and use it in GitHub Desktop.
Google Python class basic string
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/usr/bin/python | |
# Copyright 2010 Google Inc. | |
# Licensed under the Apache License, Version 2.0 | |
# http://www.apache.org/licenses/LICENSE-2.0 | |
# Google's Python Class | |
# http://code.google.com/edu/languages/google-python-class/ | |
# Additional basic string exercises | |
# D. verbing | |
# Given a string, if its length is at least 3, | |
# add 'ing' to its end. | |
# Unless it already ends in 'ing', in which case | |
# add 'ly' instead. | |
# If the string length is less than 3, leave it unchanged. | |
# Return the resulting string. | |
def verbing(s): | |
if len(s) >= 3: | |
if 'ing' in s: | |
s += 'ly' | |
else: | |
s += 'ing' | |
return s | |
# E. not_bad | |
# Given a string, find the first appearance of the | |
# substring 'not' and 'bad'. If the 'bad' follows | |
# the 'not', replace the whole 'not'...'bad' substring | |
# with 'good'. | |
# Return the resulting string. | |
# So 'This dinner is not that bad!' yields: | |
# This dinner is good! | |
def not_bad(s): | |
nidx = s.find('not') | |
bidx = s.find('bad') | |
if bidx > nidx and 'not' in s and 'bad' in s: | |
return (s[:nidx] + 'good' + s[bidx+3:]) | |
else: | |
return s | |
# F. front_back | |
# Consider dividing a string into two halves. | |
# If the length is even, the front and back halves are the same length. | |
# If the length is odd, we'll say that the extra char goes in the front half. | |
# e.g. 'abcde', the front half is 'abc', the back half 'de'. | |
# Given 2 strings, a and b, return a string of the form | |
# a-front + b-front + a-back + b-back | |
def front_back(a, b): | |
ahalf = len(a)/2 | |
bhalf = len(b)/2 | |
if len(a) % 2 == 1: | |
ahalf += 1 | |
if len(b) % 2 == 1: | |
bhalf += 1 | |
return (a[:ahalf]+b[:bhalf]+a[ahalf:]+b[bhalf:]) | |
# Simple provided test() function used in main() to print | |
# what each function returns vs. what it's supposed to return. | |
def test(got, expected): | |
if got == expected: | |
prefix = ' OK ' | |
else: | |
prefix = ' X ' | |
print '%s got: %s expected: %s' % (prefix, repr(got), repr(expected)) | |
# main() calls the above functions with interesting inputs, | |
# using the above test() to check if the result is correct or not. | |
def main(): | |
print 'verbing' | |
test(verbing('hail'), 'hailing') | |
test(verbing('swiming'), 'swimingly') | |
test(verbing('do'), 'do') | |
print 'not_bad' | |
test(not_bad('This movie is not so bad'), 'This movie is good') | |
test(not_bad('This dinner is not that bad!'), 'This dinner is good!') | |
test(not_bad('This tea is not hot'), 'This tea is not hot') | |
test(not_bad("It's bad yet not"), "It's bad yet not") | |
print 'front_back' | |
test(front_back('abcd', 'xy'), 'abxcdy') | |
test(front_back('abcde', 'xyz'), 'abcxydez') | |
test(front_back('Kitten', 'Donut'), 'KitDontenut') | |
if __name__ == '__main__': | |
main() |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment