Msaada Programmers (Python)

[ISO M.CodD]

def Equilibrum(ArrayList):
N = len(ArrayList)
EquilibrumIntegers = [ ]

for P in range(0, N+1):
lowerBound = ArrayList[0😛]
upperBound = ArrayList[P+1:N+1]
if sum(lowerBound) == sum(upperBound):
EquilibrumIntegers.append(P)

if EquilibrumIntegers == [ ]:
return -1
else:
return EquilibrumIntegers

Kama ukiamua kui test kwenye interactive shell keep in mind the indentation maana ni muhimu kwenye python.Ukizingua indentation inaweza is execute hzo nested statements

Pia hyo range( ) function happy juu bro nimetumia python 2.7.Uki run kwenye python 3.0 Ina generate iterative construct na cyo list
So I test kwenye python version less than 3.0
Kama hauna hzo version less than 3.0 then I force I generate list kwa kuongezea Neno list mbele
Have a nice day.

Ni bora kutumia pastebin kama codepad.org kutuma code.

 

[Kurt godel]

Ni bora kutumia pastebin kama codepad.org kutuma code.

Attachment nimeweka hapo ipo very well structured

 

[Kurt godel]

This is an algorithmic problem - complete with time and space complexity. Kama ndio unajifunza programming in python then angalia resources unazotumia. Hili swali hukutakiwa ukumbane nalo.

Hamna time na space complexities yoyote kwenye hhyo task.Any Turing based machine Ina solve(unge calculate O( ) yake kabla ya kutumia maneno mazito hayo)

 

[Mwelewa]

Mkuu Kart godel shukran sana. I've learnt from your contributions. And thanks for the attachment. Thumb up!

 

[Graph]

Hamna time na space complexities yoyote kwenye hhyo task.Any Turing based machine Ina solve(unge calculate O( ) yake kabla ya kutumia maneno mazito hayo)

Unavosema hakuna time complexity unajaribu kupoteza swali, hizo vocabularies "turing based machine" zinatokea wapi?. How is time and space complexity maneno mazito? Unadhani ni maneno mazito kuliko bigO?

Mleta mada kawa specific kabisa kua anahitaji solution ambayo inarun at O(n) time. Algorithm yako inarun at O(n^2) ambayo ni very slow, na inatumia way too much space kwa kufanya allocation ya items zote at every iteration of the loop. In short it is very inefficient.

 

[Jabman]

Ukitaka kuifahamu code vizuri fahamu alama zote na maana halisi.
Mi nimesoma C++ nikaja kufundishwa implementation of data structure kwa java. Ilinisumbua sana mpaka Leo nikimkumbuka Dr. Yule naudhika sana. Komaa tu polepole

 

[Mwelewa]

Mkuu Graph

Nimetuliza kichwa hapa nimeona solution uliyo provide inaeleweka kwa urahisi.

Hebu ngoja ni solve index 3 nione kama solution itakuwa sawa na current_sum

Current_sum = -2 (hii nimepata kama ulivyonielekeza sum ya index ilipofikia)

Total_sum - current_sum - current_element = 1- (-2) - 5

The answer is -2 ambayo ni sawa na current_sum kwa maana hii -2 is equilibrium

Mkuu Graph let me know if I'm correct.

 

[Graph]

Mkuu Graph

Nimetuliza kichwa hapa nimeona solution uliyo provide inaeleweka kwa urahisi.

Hebu ngoja ni solve index 3 nione kama solution itakuwa sawa na current_sum

Current_sum = -2 (hii nimepata kama ulivyonielekeza sum ya index ilipofikia)

Total_sum - current_sum - current_element = 1- (-2) - 5

The answer is -2 ambayo ni sawa na current_sum kwa maana hii -2 is equilibrium

Mkuu Graph let me know if I'm correct.

Uko sahihi.
Hapo sasa ishu ni kuandika loop tu inayosolve hili tatizo, ni kitu rahisi sana, in pseudocode.

total_sum = sum(list)
current_sum = 0

for i in range 0 to last_index
     current_element = list[i]
     if(total_sum - current_sum - current_element == current_sum)
         //its equllibrium add to list
     current_sum += current_element

if equillibrium_list is empty return -1
else return equllibrium_list

Sasa kwa kua hili swali limekupelekesha sana, sikulaumu maana kwa beginner kweli hili swali ni gumu mno, nakushauri uanze kwanza kujifunza mambo madogo madogo, soma language features, hakikisha unakua comfortable na loops, na other features ambazo language inakupa, ukiwa comfortable hamia jifunze data structures na algorithms, hizi ndo important sana kuliko hata programming languages, zinakufundisha how to program.

Hii algorithm inarun at O(n), huwezi kwenda faster than hii kwa hili swali kwa kua linainvolve summation, kwa hiyo lazima upitie kila element in the list. Unaweza usielewe hiki ni nini kama hujasoma introduction to algorithms, usiwe na haraka, ni mambo marahisi tu yanaeleweka, anza chini kwanza unapanda polepole

 

[Mwelewa]

Ukitaka kuifahamu code vizuri fahamu alama zote na maana halisi.
Mi nimesoma C++ nikaja kufundishwa implementation of data structure kwa java. Ilinisumbua sana mpaka Leo nikimkumbuka Dr. Yule naudhika sana. Komaa tu polepole

Mkuu mimi ndiyo kwanza naanza and I have convinced myself python won't be as much complicated as people want me to believe.

College nilisoma Social Science lakini mimi napenda sana vitu vinavyoonekana complicated kwa wengine. I never thought I am good in musical instruments before I started learning guitar and it took me only few weeks to master the guitar [emoji3]

Sasa hapa nikasema kwanini nisijifunze Programming?

Mkuu tuendelee kujifunza kwa bidii. Hili jukwaa ndiyo itakuwa darasa langu. Nitakuwa nakuja kuulizia usaidizi kila ninapokwama. Cheers!!

 

[Mwelewa]

Graph

Asante kwa ushauri. Ngoja nikazanie kwenye introduction to Python ili nielewe vizuri the basics kama ulivyoshauri.

And big thanks maneno yako yamenifanya nipate motivation zaidi.

"usiwe na haraka ni mambo marahisi tu yanaeleweka"

 

[Kurt godel]

Mkuu Kart godel shukran sana. I've learnt from your contributions. And thanks for the attachment. Thumb up!

Aina noma bro.Unaonekana una challenges nzuri Sana huko.Tuma challenges nyengine bro kama vipi hats zote

 

[Graph]

Onyesha calculations zinazoonyesha kuwa hyo algorithm ni O(n^2) maana naona unaongea siasa tu

We si hua ni mzee wa matusi tu, nakukumbuka sana ulinitukania mama, baba, familia yangu yote kwa kua tu nilikwambia ukweli. Ulisema wewe ni genius, umeshindwa kutambua hiyo algorithm kama ni O(n^2) alafu ukasema nina IQ ya sijui mnyama gani? hehe acha utani, ni algorithm rahisi sana haiwezi kukushinda we genius hata siku moja.
Sasa ngoja mimi kilaza nikusaidie genius.

1. for P in range(0, N+1):
2.     lowerBound = ArrayList[0:p]
3.     upperBound = ArrayList[P+1:N+1]
4.     if sum(lowerBound) == sum(upperBound):
5.         EquilibrumIntegers.append(P)

angalia line 1, it runs n times, alafu line 4, it runs n times kwa kua umeita sum(lowerBound) na sum(upperBound) ambazo zote hizi zina run n times, hii ni sawa na kuandika nested for loops. Kwa kila P, sum function itarun n times, sasa kutoka 0 to n+1 times n si ni sawa na n^2?

Kumkamata mtu anayejifanya kua na majigambo hua ni rahisi sana, muache tu ipo siku atateleza. Punguza dharau dogo genius.

 

[Kurt godel]

We si hua ni mzee wa matusi tu, nakukumbuka sana ulinitukania mama, baba, familia yangu yote kwa kua tu nilikwambia ukweli. Ulisema wewe ni genius, umeshindwa kutambua hiyo algorithm kama ni O(n^2) alafu ukasema nina IQ ya sijui mnyama gani? hehe acha utani, ni algorithm rahisi sana haiwezi kukushinda we genius hata siku moja.
Sasa ngoja mimi kilaza nikusaidie genius.

1. for P in range(0, N+1):
2.     lowerBound = ArrayList[0:p]
3.     upperBound = ArrayList[P+1:N+1]
4.     if sum(lowerBound) == sum(upperBound):
5.         EquilibrumIntegers.append(P)

angalia line 1, it runs n times, alafu line 4, it runs n times kwa kua umeita sum(lowerBound) na sum(upperBound) ambazo zote hizi zina run n times, hii ni sawa na kuandika nested for loops. Kwa kila P, sum function itarun n times, sasa kutoka 0 to n+1 si ni sawa na n^2?

Kumkamata mtu anayejifanya kua na majigambo hua ni rahisi sana, muache tu ipo siku atateleza, nilikua na ujinga kama wako wa kudharau watu ila angalau I didn't show it on the outside kutukana ovyo, mwisho wa siku nikajifunza kushirikiana na watu, now I am a better person living my dream. Punguza dharau dogo genius.

Aina noma old school

 

[ISO M.CodD]

Hamna time na space complexities yoyote kwenye hhyo task

Swali zima umelisoma bila shaka. Au sijakuelewa?

Complexity:

expected worst-case time complexity is O(N);expected worst-case space complexity is O(N), beyond input storage (not counting the storage required for input arguments).

Elements of input arrays can be modified.

 

[Kurt godel]

kipande Cha complexities nilikuwa sijakiona mudaa huo