摘要：
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自学之路和java的区别：可以用于浏览器.reacts是它的前端，Node.js是它的后段HTML在浏览器中以DOM形式表示为树形结构，document对象就是整个DOM树的根节点。 underscore是一个库，会把自身绑定到唯一的全局变量_上，这也是为啥它的名字叫underscor 阅读全文
posted @ 2021-07-25 04:41
苗妙苗
阅读(41)
评论(0)
推荐(0)
摘要：
和哪种语言无关 阅读全文
posted @ 2021-07-24 04:48
苗妙苗
阅读(41)
评论(0)
推荐(0)
摘要：
狗熊掰玉米法：看一个投一个 小本本记下来诅咒你法：筛选存一阵，然后再投。肯定是这个了。筛多少页？or say筛到多久前的帖子？不用太久的，6月初吧怎么利用之前ng投的经验？都不影响。以前没开/不招/挂了，这次都能重新再投试试。 什么顺序？还是按照自己写的tier来投。 （1）大公司提前Amazon1 阅读全文
posted @ 2021-07-20 09:27
苗妙苗
阅读(107)
评论(0)
推荐(0)
摘要：
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)
摘要：
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)
摘要：
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)
摘要：
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)
摘要：
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)
摘要：
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)
浙公网安备 33010602011771号