[leetcode 92] Reverse Linked List II
ยท
๐Ÿข One step
LeetCode-92 Reverse Linked List II : Given the head of a singly linked list and two integers left and right where left
[Reinforce Learning] Deep Q-Network
ยท
๐Ÿ‘พ Deep Learning
https://github.com/seohyunjun/Deep_RL/tree/main/1_DQN GitHub - seohyunjun/Deep_RL: Reinforcement Learning Reinforcement Learning. Contribute to seohyunjun/Deep_RL development by creating an account on GitHub. github.com CartPole-V1
[NVIDIA-GTC] The Conference for the Era of AI and the Metaverse
ยท
๐Ÿƒ Routine
https://www.nvidia.com/en-us/ World Leader in AI Computing We create the world’s fastest supercomputer and largest gaming platform. www.nvidia.com NVIDIA GTC [The Conference for the Era of AI and the Metaverse] Keynote๊ฐ€ ํ•œ์ฐฝ์ด๋‹ค. Metaverse๋ผ๋Š” ํ‘œํ˜„๋‹ต๊ฒŒ ๊ณต๋ฃก๊ธฐ์—…๋“ค ์ค‘ NVIDIA ์ œํ’ˆ์„ ๊ฑฐ์น˜์ง€ ์•Š์€ ๊ธฐ์—…์ด ์—†์—ˆ๋‹ค. ๊ฐ€์žฅ ํฅ๋ฏธ๋กœ์› ๋˜ ์ฃผ์ œ๋Š” Virtual Factory๋กœ 3D๋กœ ๋””์ง€ํ„ธ ํŠธ์œˆ์„ ๊ตฌํ˜„ํ•ด ๋†“์•˜๋‹ค. ์„ค๋น„๊ธฐ๊ธฐ๋ฅผ ๋ชจ๋ธ๋งํ•ด ๋ฏธ๋ฆฌ ๋ฐฐ์น˜๊ตฌ์—ญ์„ ๋ฆฌ์‚ฌ์ด์ง•ํ•˜๊ณ  ์œ„์น˜๋ฅผ ์กฐ์ •ํ•˜๋Š”๋ฐ ์‹ ๊ธฐํ•˜๊ณ  ์—ฌ๋Ÿฌ๋ชจ๋กœ ๋งŽ์ด ์‚ฌ์šฉ๋  ๊ฑฐ ๊ฐ™์•˜๋‹ค. https://..
[leetcode-24] Swap-Nodes-In-Pairs_2
ยท
๐Ÿข One step
LeetCode-24 swap-nodes-in-pairs_2 : Given a linked list, swap every two adjacent nodes and return its head. You must solve the problem without modifying the values in the list's nodes note : only nodes themselves may be changed.MyAnswer :::python # Definition for singly-linked list. # class ListNode: # def init(self, val=0, next=None): # self.val = val # self.next = next class Solution: def swap..
[Whisper] Robust Speech Recognition via Large-Scale Weak Supervision - (4)
ยท
๐Ÿ‘พ Deep Learning
https://bnmy6581.tistory.com/133 --(1) [Whisper] Robust Speech Recognition via Large-Scale Weak Supervision - (1) bnmy6581.tistory.com https://bnmy6581.tistory.com/134 --(2) [Whisper] Robust Speech Recognition via Large-Scale Weak Supervision - (1) bnmy6581.tistory.com https://bnmy6581.tistory.com/135--(3) [Whisper] Robust Speech Recognition via Large-Scale Weak Supervision - (1) bnmy6581.tistor..
[leetcode 24] Swap Nodes in Pairs
ยท
๐Ÿข One step
LeetCode-24 swap-nodes-in-pairs : Given a linked list, swap every two adjacent nodes and return its head. You must solve the problem without modifying the values in the list's nodes note : only nodes themselves may be changed.MyAnswer :::python # Definition for singly-linked list. # class ListNode: # def init(self, val=0, next=None): # self.val = val # self.next = next class Solution: def swapPa..
๋‹คํ–ˆ๋‹ค
B's