Yuming's Personal Website

爱你所爱，行你所行；听从你心，无问西东。

5/12的一些感悟😢

5/12的一些感悟😢 我发现我好几次在帮别人好几次调解情绪的时候被怼也许对方当面就表达出不高兴了，抑或是没说但心里不高兴了我觉得我真的应该审视这一点因为这类事情对我来说是纯粹的亏损我不会因为帮助别人而获得任何回报或者感激，相反还会让别人对我不爽，我真的是哑巴吃黄连可能对方会觉得你作为我的朋友，应该要替我说话，跟着我骂别人，要么你就骂我但事实上我觉得很多事情，他阐述出...

Posted by Ethan on May 12, 2022

💵算法合集 (Algorithm)

💵算法合集 (Algorithm) 🌳 Tree DFS/BFS 🗺️Graph DFS/BFS 🔙Backtracking 🥵Union Find 🔠Trie 📈Dynamic Programming 🔍Binary Search 📌Two Pointers 🎡Sliding Windows 🌀Heap/Stack/Queue 🎰Hash Table 🖇️Link...

Posted by Ethan on May 8, 2022

Union Find Exercise 1

Union Find Exercise 1 Part 1. 基本概念并查集是一种数据结构并查集这三个字，一个字代表一个意思。并（Union），代表合并查（Find），代表查找集（Set），代表这是一个以字典为基础的数据结构，它的基本功能是合并集合中的元素，查找集合中的元素并查集的典型应用是有关连通分量的问题并查集解决单个问题（添加，合并，查找）...

Posted by Ethan on May 8, 2022

Two Pointers Exercise 2

Two Pointers Exercise 2 680. Valid Palindrome II 难度简单487 Given a string s, return true if the s can be palindrome after deleting at most one character from it. Example 1: Input: s = "aba" Outp...

Posted by Ethan on May 8, 2022

Stack/Queue/Heap Exercise 2

Stack/Queue/Heap Exercise 2 1249. Minimum Remove to Make Valid Parentheses 难度中等178 Given a string s of '(' , ')' and lowercase English characters. Your task is to remove the minimum number of p...

Posted by Ethan on May 8, 2022

Sort Exercise 1

Sort Exercise 1 时间复杂度为O(n^2)的排序算法：

Posted by Ethan on May 8, 2022

Linked List Exercise 1

Linked List Exercise 1 203. 移除链表元素难度简单794 给你一个链表的头节点 head 和一个整数 val ，请你删除链表中所有满足 Node.val == val 的节点，并返回新的头节点。示例 1：输入：head = [1,2,6,3,4,5,6], val = 6 输出：[1,2,3,4,5] 示例 2：输入：head = [...

Posted by Ethan on May 8, 2022

Hash Table Exercise 2

Hash Table Exercise 2 1570. Dot Product of Two Sparse Vectors 难度中等20 Given two sparse vectors, compute their dot product. Implement class SparseVector: SparseVector(nums) Initializes the ob...

Posted by Ethan on May 8, 2022

Binary Tree Exercise 3

Binary Tree Exercise 3 2096. Step-By-Step Directions From a Binary Tree Node to Another 难度中等34 You are given the root of a binary tree with n nodes. Each node is uniquely assigned a value from 1...

Posted by Ethan on May 8, 2022

Binary Tree Exercise 2

Binary Tree Exercise 2 1.1 深度优先遍历使用的数据结构（栈）：在深度优先遍历的过程中，需要将当前遍历到的结点的相邻结点暂时保存起来，以便在回退的时候可以继续访问它们。遍历到的结点的顺序呈现「后进先出」的特点，因此深度优先遍历可以通过「栈」实现。在Python中，列表就满足后进先出的要求（append，pop）对于之前做过的二叉树的前中后序遍历...

Posted by Ethan on May 8, 2022