- 博客(6)
- 收藏
- 关注
RSS订阅原创 Three Traversal of Binary Tree
PreorderThe preoder is as same as the DFS like root, left, right. The tranversal starts from root (1) , then visit its left grand child at the leave level (3), then its right child (4), the next visit should be their father node’s sibling (5) which is the
2020-12-13 14:15:02
100
1
转载 Frontend 当前前端的三种渲染方式
**当前前端的三种渲染方式：1. CSR （Client Side Rendering）Rendering an app in a browser, generally using the DOM. - React(Angular / Vue)前后端分离带来了CSR， 同时带来了各种问题。SEO， CSR 首次加载的HTML 文档没有内容， 而目前多数Search Engine 主要识别的内容还是HTML，对JS文件内容识别比较弱。JS代码量 & 首屏高性能。因为CSR的加载一般
2020-11-24 11:16:14
331
原创 Leetcode 1640. Check Array Formation Through Concatenation
Check Array Formation Through ConcatenationYou are given an array of distinct integers arr and an array of integer arrays pieces, where the integers in pieces are distinct. Your goal is to form arr by concatenating the arrays in pieces in any order. Howe.
2020-11-10 19:41:42
129
原创 Leetcode 1486. XOR Operation in an Array
XOR Operation in an ArrayGiven an integer n and an integer start.Define an array nums where nums[i] = start + 2*i (0-indexed) and n == nums.length.Return the bitwise XOR of all elements of nums.Example 1:Input: n = 5, start = 0Output: 8Explanation.
2020-11-10 13:24:51
61
原创 Leetcode 1389. Create Target Array in the Given Order
Create Target Array in the Given OrderGiven two arrays of integers nums and index. Your task is to create target array under the following rules:Initially target array is empty.From left to right read nums[i] and index[i], insert at index index[i] the.
2020-11-10 11:21:27
95
原创 Leetcode 1. 反转链表
Leetcode 1 反转链表Ex: 1 -> 2 > 3Output: 3- >2 ->1public class Solution { public ListNode ReverseList(ListNode head) { ListNode pre = null; ListNode current = head; ListNode next = null; ListNode temp = null;
2020-11-07 15:55:07
192
1
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人