Subscribe to:
Post Comments (Atom)
LeetCode 30 Day Challenge | Day 7 | Counting Elements
Given an integer array arr , count element x such that x + 1 is also in arr . If there're duplicates in arr , count them sepe...
-
void print_kth_from_end( Node *head, int k){ Node *lead = head; Node *lag = head; while (k > 0 ){ ... -
Characteristics: No Supervisor, Reward signal Delayed Feedback Data depends on Agent's actions Examples... -
C++ Code: void swap_nodes( Node **headPtr, int a, int b){ if (a == b || !headPtr || !(*headPtr)) return ; ...
No comments:
Post a Comment