FilesExpand file tree

 master

/

string2.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

executable file

·

109 lines (91 loc) · 2.96 KB

 master

/

string2.py

Copy path

Top

File metadata and controls

• Code
• Blame

executable file

·

109 lines (91 loc) · 2.96 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

88

89

90

91

92

93

94

95

96

97

98

99

100

101

102

103

104

105

106

107

108

109

#!/usr/bin/python2.4 -tt

# 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):

# +++your code here+++

if len(s)>=3:

if s[-3:] == 'ing':

s=s+'ly'

else:

s=s+'ing'

else:

s=s

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):

# +++your code here+++

i_not = s.find('not')

i_bad = s.find('bad')

if(i_not < i_bad and i_not != -1 and i_bad != -1):

#notbad = s[i_not:(i_bad+3)]

#s = s.replace(notbad, 'good')

s = s[:i_not] +'good'+s[i_bad+3:]

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):

# +++your code here+++

if(len(a)%2 == 0):

front_a = a[:len(a)/2]

#back_a = a.strip(front_a)

else:

front_a = a[:(len(a)-1)/2+1]

back_a = a.replace(front_a, '')

if(len(b)%2 == 0):

front_b = b[:len(b)/2]

#back_a = a.strip(front_a)

else:

front_b = b[:(len(b)-1)/2+1]

back_b = b.replace(front_b, '')

return front_a + front_b + back_a + back_b

# 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

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

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()