关于虚拟机 virtualBox VMware 和 wsl如果要使用hypervisor 管理员运行cmd 关闭hyper 1bcdedit /set hypervisorlaunchtype off 关闭后会方便虚拟机virtualBox的使用 但是会影响wsl使用 VMware找微软要了hypervisor的权限 所以不需要对这个进行调整 重新打开 1bcdedit /set hypervisorlaunchtype auto

UE 基础gainian必要的规范以下规范仅作部分内容展示,随着文章推进逐步在后文补充,无法就此处进行展开. 命名规范:1.U++根据继承的父类及使用的功能分类进行命名: ​ a.继承自UObject的请使用U开头 ​ b.继承自SWidget的请使用S开头 ​ c.继承自AAcotr的请使用A开头 ​ d.接口的类前缀为I ​ e.模板的类前缀为T ​ f.枚举的前缀为E ​ g.布尔变量前缀为b ​ h.其他多数类均以F为前缀,如结构体 ​ i.动态多播,动态单播请以F开头,单播和多播建议以F开头 ​ j.Typedefs应以任何与其类型相符的字母为前缀：若为结构体的Typedefs，则使用F；若为 Uobject 的Typedefs，则使用U，以此类推。 ​ k.特化的Typedef不再是模板，并应加上相应前缀，例如：typedef TArray FArrayOfMyTypes; 2.UHT需要正确的前缀,因此添加前缀很重要 3.类型和变量的命名为名词 4.方法名是动词，以描述方法的效果或被方法影响的返回值 5.所 ...

COEN 329 MidPart1Q-in-Q frame format, function Basic Q-in-Q Selective Q-in-Q Network Processor: fast path, process path, CAM Layer 2, Layer 3 Methods Scheduling Classification Forwarding STUN DRR (Deficit Round Robin) Link aggregation VPLS Concept Loop prevention, PEs function Full mesh MPLS 做了什么 VPN是什么 Mac in Mac in the backbone we use it double level 是什么 我们有两个level outer level和inner level作为vpn level 和vpn 等等 外层level就是这些 inner level是cus ...

DFS / BacktrackingDepth-First Search (DFS), combined with backtracking, is an algorithmic technique used to explore all possible states by constructing partial solutions and undoing choices when needed. It is widely applied in enumeration, searching, and constraint-based problems. When to Use DFS / Backtracking?DFS is suitable for enumeration problems: 1. Combination ProblemsUsed to generate all possible subsets or combinations of items. Examples include subsets, selecting k items, or ...

Graph ProblemsGraph problems are very common in coding interviews. The main focus areas include graph construction, graph traversal (BFS/DFS), path search, connectivity checks, and Union-Find (Disjoint Set Union, DSU). Below is a comprehensive summary. 1. How to Build a Graph (Adjacency List)The most common representation is the Adjacency List. In Python, we usually use collections.defaultdict(list): 123456789import collectionsgraphs = collections.defaultdict(list)# edges is a list of pair ...

Graphic Interview QuestionC++Day1 What are references in C++? What is a virtual function in C++ and why is it used? What is the difference between new and malloc()? Explain the inline keyword. Day2 What is the difference between reference and pointer? What is the difference between function overloading and operator overloading? What is the difference between virtual functions and pure virtual functions? When should we use multiple inheritance? What are destructors in C++? Is destructor overlo ...

Chapter 7: Heap + Top K + Monotonic Stack1. HeapUse Case: Find the largest or smallest number among N elements. Push / Pop: O(log N) Peek: O(1) Common Problems: Top K Problem: Find Kth largest → use Min Heap Find Kth smallest → use Max Heap Example Problems: Merge k Sorted Lists Find Median from Data Stream Kth Smallest Element in a Sorted Matrix Find K Pairs with Smallest Sums Reorganize String Top K Examples: Kth Largest Element in an Array Top K Frequent Words ...

Two Pointers & Linked ListThe Two Pointer technique is one of the most elegant tools in algorithm design. It reduces time complexity by avoiding redundant traversal and is widely used in string, array, and linked list problems. This chapter explains when and how to use it, the logic behind fixed and floating pointers, and how this pattern connects to linked list problems. When to Use Two PointersTwo Pointers are typically used in: String Manipulation — e.g., reversing or checking palindrom ...

Binary Search Problem Set1. Template Binary Search ProblemsThese are the classic binary search applications, usually searching directly in arrays or matrices. 704. Binary Search Given a sorted array of integers and a target value, return the index if the target is found. If not, return -1. 702. Search in a Sorted Array of Unknown Size You are given an array-like data structure with get(index) API but you don’t know the size. Find the target in this sorted structure with minimal calls to get. 74 ...