07 2021 档案

2021年7月底在招ng的公司
摘要：直接敲在文本岂不是更快？反正不给面试的话，一个个还去填表就太累了！ 微软AmazonTwitchbloombergvmwarelinkedin高盛zoomwisheBayfb Morgan Stanley Airbnb 字节跳动SnapchatGoogle蓝鸟DoordashSquareRubrik 阅读全文
posted @ 2021-07-28 01:52 苗妙苗 阅读(25) 评论(0) 推荐(0)
第一次学习graph ql
摘要：REST API是一种架构风格，而 GraphQL 是一种查询语言。GraphQL 服务器可用于多种语言，例如Java、Python不是nosql，Neo4j用的Cypher语言才是 https://www.fullstacktutorials.com/interviews/graphql-inte 阅读全文
posted @ 2021-07-26 04:14 苗妙苗 阅读(101) 评论(0) 推荐(0)
艰苦卓绝的js自学之路
摘要：艰苦卓绝的js自学之路和java的区别：可以用于浏览器.reacts是它的前端，Node.js是它的后段HTML在浏览器中以DOM形式表示为树形结构，document对象就是整个DOM树的根节点。 underscore是一个库，会把自身绑定到唯一的全局变量_上，这也是为啥它的名字叫underscor 阅读全文
posted @ 2021-07-25 04:41 苗妙苗 阅读(41) 评论(0) 推荐(0)
响应式编程就是给动态数据流编程，比如Excel单元格计算、推特
摘要：和哪种语言无关 阅读全文
posted @ 2021-07-24 04:48 苗妙苗 阅读(41) 评论(0) 推荐(0)
简历要按啥子顺序投哦？& 我自己心里的公司tier & 英文套话模板
摘要：狗熊掰玉米法：看一个投一个 小本本记下来诅咒你法：筛选存一阵，然后再投。肯定是这个了。筛多少页？or say筛到多久前的帖子？不用太久的，6月初吧怎么利用之前ng投的经验？都不影响。以前没开/不招/挂了，这次都能重新再投试试。 什么顺序？还是按照自己写的tier来投。 （1）大公司提前Amazon1 阅读全文
posted @ 2021-07-20 09:27 苗妙苗 阅读(107) 评论(0) 推荐(0)
1469. Find All The Lonely Nodes 独生子女节点
摘要：In a binary tree, a lonely node is a node that is the only child of its parent node. The root of the tree is not lonely because it does not have a par 阅读全文
posted @ 2021-07-19 09:17 苗妙苗 阅读(79) 评论(0) 推荐(0)
965. Univalued Binary Tree 整个一样的二叉树
摘要：A binary tree is univalued if every node in the tree has the same value. Return true if and only if the given tree is univalued. Example 1: Input: [1, 阅读全文
posted @ 2021-07-19 03:23 苗妙苗 阅读(28) 评论(0) 推荐(0)
938. Range Sum of BST 二叉树范围内求和
摘要：Given the root node of a binary search tree and two integers low and high, return the sum of values of all nodes with a value in the inclusive range [ 阅读全文
posted @ 2021-07-19 01:41 苗妙苗 阅读(41) 评论(0) 推荐(0)
897. Increasing Order Search Tree 只有右节点的子树
摘要：Given the root of a binary search tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, and every no 阅读全文
posted @ 2021-07-18 09:19 苗妙苗 阅读(39) 评论(0) 推荐(0)
872. Leaf-Similar Trees 叶子顺序遍历是否相等
摘要：Consider all the leaves of a binary tree, from left to right order, the values of those leaves form a leaf value sequence. For example, in the given t 阅读全文
posted @ 2021-07-15 09:27 苗妙苗 阅读(69) 评论(0) 推荐(0)
700. Search in a Binary Search Tree 在bst中返回目标所在的最小子树
摘要：You are given the root of a binary search tree (BST) and an integer val. Find the node in the BST that the node's value equals val and return the subt 阅读全文
posted @ 2021-07-12 08:11 苗妙苗 阅读(37) 评论(0) 推荐(0)
n杈树的先序遍历589. N-ary Tree Preorder Traversal
摘要：Given the root of an n-ary tree, return the preorder traversal of its nodes' values. Nary-Tree input serialization is represented in their level order 阅读全文
posted @ 2021-07-12 01:28 苗妙苗 阅读(33) 评论(0) 推荐(0)
559. Maximum Depth of N-ary Tree n杈树的最大深度
摘要：Given a n-ary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest le 阅读全文
posted @ 2021-07-12 00:19 苗妙苗 阅读(37) 评论(0) 推荐(0)
144. Binary Tree Preorder Traversal 二叉树先序遍历
摘要：Given the root of a binary tree, return the preorder traversal of its nodes' values. Example 1: Input: root = [1,null,2,3] Output: [1,2,3] Example 2: 阅读全文
posted @ 2021-07-11 10:01 苗妙苗 阅读(42) 评论(0) 推荐(0)
98. Validate Binary Search Tree 检验二叉树是不是bst
摘要：Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as follows: The left subtree of a node co 阅读全文
posted @ 2021-07-11 09:14 苗妙苗 阅读(42) 评论(0) 推荐(0)
binary tree解题模板
摘要：基础的三个模板：traverse, dc, bst 【traverse模板】 题：700. Search in a Binary Search Tree 在bst中返回目标所在的最小子树 class Solution { public TreeNode searchBST(TreeNode root 阅读全文
posted @ 2021-07-10 04:17 苗妙苗 阅读(105) 评论(0) 推荐(0)
对称二叉树 · symmetric binary tree
摘要：Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmet 阅读全文
posted @ 2021-07-08 01:25 苗妙苗 阅读(42) 评论(0) 推荐(0)
108 Convert Sorted Array to Binary Search Tree数组变成高度平衡的二叉树
摘要：Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced binary tree is d 阅读全文
posted @ 2021-07-08 00:18 苗妙苗 阅读(35) 评论(0) 推荐(0)
530.Minimum Absolute Difference in BST 二叉搜索树中的最小差的绝对值
摘要：Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes. Example: Input: 1 \ 3 / 2 O 阅读全文
posted @ 2021-07-07 09:29 苗妙苗 阅读(40) 评论(0) 推荐(0)
pp 集成工程师 mism师兄问一问
摘要：tech sells，说话的岗位在费城，用js问了安卓项目, ds web项目api sdk 区别 阅读全文
posted @ 2021-07-07 08:44 苗妙苗 阅读(56) 评论(0) 推荐(0)
17. Merge Two Binary Trees 融合二叉树
摘要：［抄题］： Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others 阅读全文
posted @ 2021-07-07 02:28 苗妙苗 阅读(39) 评论(0) 推荐(0)
270. Closest Binary Search Tree Value 二叉搜索树中，距离目标值最近的节点
摘要：Given the root of a binary search tree and a target value, return the value in the BST that is closest to the target. Example 1: Input: root = [4,2,5, 阅读全文
posted @ 2021-07-06 03:24 苗妙苗 阅读(49) 评论(0) 推荐(0)