ขนาดวิดีโอ: 1280 X 720853 X 480640 X 360
แสดงแผงควบคุมโปรแกรมเล่น
เล่นอัตโนมัติ
เล่นใหม่
Thank you!!! Really great video, hope you could talk about the time complexity and space complexity at the end of your video.
Great suggestion!
lol 0:21 dream started as a mermaid. Good video and good answer Thank you.
Great explanation!
I'd argue the runtime complexity of Approach #1 is O(2(0 + 1 + 2 + ... + k)) = O(k^2) and Approach #2 is O(0 + 1 + 2 + ... + k) = O(k^2). Same!
I feel like there's a recurrence relationship between the row and element index? What am I missing?
Thank you!!! Really great video, hope you could talk about the time complexity and space complexity at the end of your video.
Great suggestion!
lol 0:21 dream started as a mermaid. Good video and good answer Thank you.
Great explanation!
I'd argue the runtime complexity of Approach #1 is O(2(0 + 1 + 2 + ... + k)) = O(k^2) and Approach #2 is O(0 + 1 + 2 + ... + k) = O(k^2). Same!
I feel like there's a recurrence relationship between the row and element index? What am I missing?