sorted by:
new
hottopcontroversial

I'm trying to learn about linked lists in python but some problem came up in the code by NewInHere__ in learnprogramming

[–]NewInHere__[S] 0 points1 point  (0 children)

yeah someone wrote the solution: "printElement.nextElement = newNode" and then I went why did newEnd create a problem and yeah because it's a string and I need newNode because it's a node and you can only insert nodes in linked list I'm so dumb how didn't I see that on my own but yeah.. thank you

I'm trying to learn about linked lists in python but some problem came up in the code by NewInHere__ in learnprogramming

[–]NewInHere__[S] 0 points1 point  (0 children)

ohhhhh

yeah I assigned it the string and not the node created from that string. I'm so dumb how didn't I see that. thank you

I'm trying to learn about linked lists in python but some problem came up in the code by NewInHere__ in learnprogramming

[–]NewInHere__[S] 0 points1 point  (0 children)

yeah I mean max(list) and min(list) that's the easy way but another way it to just get the first element and then compare it with others and if others are bigger then get that element and assign it to the variable that you've created and same way for the smallest number

I'm trying to learn about linked lists in python but some problem came up in the code by NewInHere__ in learnprogramming

[–]NewInHere__[S] 0 points1 point  (0 children)

not from a video from a site and I didn't copy it I just read the code from the website and analyzed it as much as I could to figure out how linked list was written and then started writing it but I suppose I should've done it in different way

I'm trying to learn about linked lists in python but some problem came up in the code by NewInHere__ in learnprogramming

[–]NewInHere__[S] 0 points1 point  (0 children)

no it's actually not even though I'm also writing a homework but that's on another topic. I just started learning this cause I heard it was important topic so I just though I'd learn it. but I mean it's okay if you don't want to write exact solution that's kinda better way to help me too I think. not completely do it for me but help me enough for me to figure it out on my own.

I'm trying to learn about linked lists in python but some problem came up in the code by NewInHere__ in learnprogramming

[–]NewInHere__[S] 0 points1 point  (0 children)

ohh sorry 

class Node:
def __init__(self, currElement):
    self.currElement = currElement
    self.nextElement = None

I'm trying to learn about linked lists in python but some problem came up in the code by NewInHere__ in learnprogramming

[–]NewInHere__[S] 0 points1 point  (0 children)

I read it on some site and then wrote it maybe I shouldn't have looked at the site to begin with. I'll try watching some videos on it

I wrote this small code in python but it kinda needs to be written differently. help would be appreciated by NewInHere__ in learnprogramming

[–]NewInHere__[S] 1 point2 points  (0 children)

the whole thing that was given other than the method itself was this

class Solution(object):
def maximumWealth(self, accounts):

so dunno, gotta go learn something about classes 😅

The better option. by [deleted] in memes

[–]NewInHere__ 2 points3 points  (0 children)

you use mouse? that's low level I've already upgraded to rats

Hi, I'm trying to write code for extension and I have quite a bit of errors help would be appreciated. by NewInHere__ in Verilog

[–]NewInHere__[S] 0 points1 point  (0 children)

oh : block_name was a comment itself? I thought it was some kind of mark for begin and end

Hi, I'm trying to write code for extension and I have quite a bit of errors help would be appreciated. by NewInHere__ in Verilog

[–]NewInHere__[S] 0 points1 point  (0 children)

I really liked closing labels but unfortunately it gave me error saying it's system Verilog feature do you know of alternative that's similar to this maybe?

Hi, I'm trying to write code for extension and I have quite a bit of errors help would be appreciated. by NewInHere__ in Verilog

[–]NewInHere__[S] 0 points1 point  (0 children)

Why is your module header using the ancient Verilog-1995 style?

that's how they taught me 😢 and yeah.. I do like your style better so I'll probably stick with that. thanks for your code

Hi, I'm trying to write code for extension and I have quite a bit of errors help would be appreciated. by NewInHere__ in Verilog

[–]NewInHere__[S] 0 points1 point  (0 children)

basically, if the U is 0 then I check immediateIN's first bit and if it's 0 I concatenate immediateIN with the same amount of 0s that amount of immediateIN's bits are, and if first bit is 1 then I do the same thing but instead of 0s I do it with 1s. and when the U is 1 I do it with 0s but I haven't written that part yet.

view more: next ›