[leetcode-622] Design Circular Queue
ยท
๐Ÿข One step
LeetCode-622 Design Circular Queue : Design your implementation of the circular queue. The circular queue is a linear data structure in which the operations are performed based on FIFO (First In First Out) principle, and the last position is connected back to the first position to make a circle. It is also called "Ring Buffer". note : You must solve the problem without using the built-in queue d..
Apple Easter Egg (feat.Mac >= Mojave)
ยท
๐Ÿƒ Routine
https://discussions.apple.com/thread/254768314 VirtualScanner.App [simpledoc.pdf] - Apple Community You posted in the Ventura community which is the right place, but only the macOS Product team can remove that simpledoc.pdf file. That is why I stated that it eliminates anyone posting here because we don't have the access privileges, or access to the Vent discussions.apple.com Satoshi Nakamoto์˜ ๋น„..
[M1] Whisper.cpp Deploy C++ (ALL OS-)
ยท
๐Ÿ‘พ Deep Learning
https://github.com/ggerganov/whisper.cpp GitHub - ggerganov/whisper.cpp: Port of OpenAI's Whisper model in C/C++ Port of OpenAI's Whisper model in C/C++. Contribute to ggerganov/whisper.cpp development by creating an account on GitHub. github.com M1 Install 1 . git clone์œผ๋กœ ์ตœ์‹  ๋ฒ„์ „์œผ๋กœ ์„ค์น˜ํ•  ๊ฒฝ์šฐ M1์—์„œ .o architecture error ๋ฐœ์ƒ์œผ๋กœ [stable version]์„ ๋‹ค์šด๋กœ๋“œ ํ•œ๋‹ค. https://github.com/ggerganov/whisper.cpp/releases/..
[leetcode-232] Implement Queue using Stacks
ยท
๐Ÿข One step
LeetCode-232 Implement Queue using Stacks : Implement a first in first out (FIFO) queue using only two stacks. The implemented queue should support all the functions of a normal queue (push, peek, pop, and empty). note : sub์„ ์ž…์„ ์ถœ :::python class MyQueue: def init(self): self.temp = collections.deque() def push(self, x: int) -> None: self.temp.append(x) def pop(self) -> int: return self.temp.pople..
[leetcode-225] Implement Queue using Stacks
ยท
๐Ÿข One step
LeetCode-225 Implement Queue using Stacks : Implement a last-in-first-out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal stack note : last-in-first-out (LIFO) Answer :::python class MyStack: def init(self): self.temp = [] def push(self, x: int) -> None: self.temp.append(x) def pop(self) -> int: return self.temp.pop() def top(self) -> int: r..
[RL] Deep Deterministic Policy Gradient (A.K.A DDPG)
ยท
๐Ÿ‘พ Deep Learning
https://github.com/seohyunjun/RL_DDPG GitHub - seohyunjun/RL_DDPG: CONTINUOUS CONTROL WITH DEEP REINFORCEMENT LEARNING (a.k.a DDPG) CONTINUOUS CONTROL WITH DEEP REINFORCEMENT LEARNING (a.k.a DDPG) - GitHub - seohyunjun/RL_DDPG: CONTINUOUS CONTROL WITH DEEP REINFORCEMENT LEARNING (a.k.a DDPG) github.com DDPG * Continuous Action Space RL ๋ฌธ์ œ ํ•ด๊ฒฐ (๊ธฐ์กด์˜ DQN discrete action space) * DQN์—์„œ actor-critic ์‚ฌ..
๋‹คํ–ˆ๋‹ค
B's