python - Need assistance with sentence analysis -


my code takes sentence , finds given word in sentence.

if word in sentence needs has found word , positions said word in.

if word not in sentence should display error message.

i have this:

print("please insert sentence without punctuation") sentence=(input()) variable1='sentence' print("which word find in sentence?") word=input() variable2='word' if 'word'=='country':     'variable3'==5     'variable4'==17 if word in sentence:     print([word], "is in positions", [variable3], "and", [variable4]); else:     print("your word not in sentence!")

i want deal misunderstandings in presented code.

first,

print("please insert sentence without punctuation") sentence=(input())

is simpler 

sentence = input("please insert sentence without punctuation")

now have variable called sentence wihich should not muddled string 'sentence'

similarly can say

word = input("which word find in sentence?")

gives variable word again not muddled string 'word'

suppose sake of argument have,

sentence = "has got elephant in?"

and search word 'elephant'

the posted code attempts use in, happen:

>>> "elephant" in sentence true >>> "ele" in sentence true >>> "giraffe" in sentence false >>>

close. not close enough. not looking whole word, since found 'ele' in 'elephant'.

if split sentence words, suggested other answer, can search whole words and find position. (look split; can choose other characters default ' ').

words = sentence.split() word = 'ele' words.index(word)

if word isn't there error:

traceback (most recent call last): file "<stdin>", line 1, in <module> valueerror: 'ele' not in list

i leave error handling you.


Comments

Post a Comment

Popular posts from this blog

sql - can we replace full join with union of left and right join? why not? -

can replace full join union of left , right join? if no,why? 'yes' if t1 , t2 sets (no duplicated rows), otherwise answer 'no'. create table t1 (i int); create table t2 (i int); insert t1 values (1); insert t1 values (2); insert t1 values (2); insert t2 values (3); full join select * t1 full join t2 on t1.i=t2.i order 1,2 1 (null) 2 2 2 2 (null) 3 union select * t1 left join t2 on t1.i=t2.i union select * t1 right join t2 on t1.i=t2.i order 1,2 1 (null) 2 2 (null) 3 union all select * t1 left join t2 on t1.i=t2.i union select * t1 right join t2 on t1.i=t2.i order 1,2 1 (null) 2 2 2 2 2 2 2 2 (null) 3
Read more

javascript - Parallax scrolling and fixed footer code causing width issues -

i bolted bits of code. 1 parallax scrolling, , other piece of fixed footer code found here: http://codepen.io/madshaakansson/pen/cgjch though after bolting , fixing few issues, have problem different widths. header different width footer, , main content doesnt span whole width of page. have tried adjusting width of content css 100%, made main content span whole width, ended breaking footer. i not sure need change make these different bits of code work together. advice appreciated. my attempt: http://codepen.io/dingerzat/pen/qgbwkk html /*global define: false */ function init() { window.addeventlistener('scroll', function(e) { var distancey = window.pageyoffset || document.documentelement.scrolltop, shrinkon = 300, header = document.queryselector("header"); if (distancey > shrinkon) { classie.add(header, "smaller"); } else { if (classie.has(header, ...
Read more

iOS: Performance of reloading UIImage(name:...) -

i have tableview , each row has icon. 90% of rows have same icon. in cellforrowatindexpath method load image assets folder this: var cellimage = uiimage(named: "myimage") does pose performance problem? os somehow smart enough it's same image each time? better if loaded image once , saved in class variable , assigned each time? uiimage 's named: api does kind of caching. if @ uiimage's documentation , states: use init(named:in:compatiblewith:) method (or init(named:) method) create image image asset or image file located in app’s main bundle (or other known bundle). because these methods cache image data automatically, recommended images use frequently.
Read more