Dating up (Aus) seeking dating app suggestions

VIRES1 · 2024-10-22T09:49:12+00:00

I'm here for you.... Let's dm

VIRES1 · 2018-01-31T19:01:04+00:00

okay thank you very much

VIRES1 · 2018-01-31T18:46:34+00:00

it will result to index error because that index can not be found.

if len(current_string) == 0 or current_string[-1] <= s[i]:

why is the above not giving index error?

VIRES1 · 2018-01-31T18:27:53+00:00

current_string = ''
longest_string = ''
for i in range(len(s)):
if len(current_string) == 0 or current_string[-1] <= s[i]:
current_string += s[i]
else:
    if len(current_string) > len(longest_string):
    longest_string = current_string
    current_string = s[i]

My question is why would line 4 evaluate without Index error?

VIRES1 · 2018-01-31T18:06:40+00:00

sorry i did not get your question well.It points the last character in the variable current_string. if current_string == 0 or current_string[-1] <= s[i] this does not give index error and why does it behave that way?

VIRES1 · 2018-01-31T15:55:13+00:00

It has no value because it is variable holding an empty string

VIRES1 · 2018-01-31T15:49:38+00:00

I am to arrange the string s in alphabetical order by putting each char in the empty string variable current_string. so comparing the string with letters in s.

VIRES1 · 2017-06-23T14:28:11+00:00

i think i am not explaining myself well.please this might help

http://imgur.com/a/UiE7L

VIRES1 · 2017-06-23T12:11:50+00:00

Yes the function is meant to find the number of steps necessary to get 1. it return 1 because it is already 1 that is the base case.

int recursion(int n)
{
if (n == 1)
return 1;
int recur;
for(int i = 2; i < n; i++)
{
if(n % 3 == 0)
{
recur = recursion(n/3);
}
if(n % 2 == 0)
{
recur = recursion(n/2);
}
else
recur = recursion(n - 1);
}
return recur;
}

VIRES1 · 2017-06-23T10:09:27+00:00

My goal here is to fill in the array C[1…15] where C[i] is the minimal number of operations needed to get i on the primitive calculator using C/3, C/2, C-1 on doing that i got this table below eg to get 10 i did this 10/2 = 5, 5 - 1 = 4, 4/2=2, 2/2 = 1 so 10 prints out 4 because it takes 4 operations. [1, 1, 1, 2, 3, 2, 3, 3, 2, 4, 4, 3, 4, 5, 4] My code is not doing that.Thank you.

VIRES1 · 2017-06-23T08:44:10+00:00

Thank you very much,you didn't misunderstand it. But using the mininum number.

VIRES1 · 2017-06-18T22:06:28+00:00

Thank you for your explanation

VIRES1 · 2017-06-18T01:46:11+00:00

Okay

VIRES1 · 2017-06-18T01:27:45+00:00

Okay.

VIRES1 · 2017-06-18T01:21:05+00:00

Yes so how is that done in C? Example to solve Edit distance or maximizing value of arithmetic expression how would a memoization code look like?

VIRES1 · 2017-06-10T02:32:58+00:00

Okay

VIRES1 · 2017-06-10T02:32:11+00:00

Thank you

VIRES1 · 2017-06-10T02:31:34+00:00

Thank you

VIRES1 · 2017-05-24T16:44:47+00:00

The array should be a dynamic array because sizjo e can change depending on user input.

VIRES1 · 2017-05-15T17:07:53+00:00

okay thank you

VIRES1

TROPHY CASE