运动学与质量和受力无关，只研究位置，速度，姿态，角速度等参量 坐标系变换与旋转矩阵 $p$在$\mathcal{A}$中的坐标为$\begin{bmatrix}p_1&p_2&p_3\end{bmatrix}^\mathrm

LeetCode 701. Insert into a Binary Search TreeLeetCode-701 You are given the root node of a binary search tree (BST) and

LeetCode 530. Minimum Absolute Difference in BSTLeetCode-530 Given the root of a Binary Search Tree (BST), return the mi

LeetCode 501. Find Mode in Binary Search TreeLeetCode-501 Given the root of a binary search tree (BST) with duplicates,

LeetCode 108. Convert Sorted Array to Binary Search TreeLeetCode-108 Given an integer array nums where the elements are

LeetCode 98. Validate Binary Search TreeLeetCode-98 Given the root of a binary tree, determine if it is a valid binary s

LeetCode 700. Search in a Binary Search TreeLeetCode-700 You are given the root of a binary search tree (BST) and an int

LeetCode 617. Merge Two Binary TreesLeetCode-617 You are given two binary trees root1 and root2. Imagine that when you p

LeetCode 654. Maximum Binary TreeLeetCode-654 You are given an integer array nums with no duplicates. A maximum binary t

LeetCode 105. Construct Binary Tree from Preorder and Inorder TraversalLeetCode-105 Given two integer arrays preorder an

Eigen把Eigen拷贝到外面，就可以直接 #include <Eigen/Dense>sudo cp -r /usr/local/include/eigen3/Eigen /usr/local/include 直接可以编译g

bash 和 zsh 切换chsh -s /bin/bash chsh -s /bin/zsh tar解压单个文件tar -zxvf ***.tar.gz 多个文件ls model.tar.g* | xargs -n1 tar xzvf P