04 2019 档案
摘要:117. Populating Next Right Pointers in Each Node II Given a binary tree Populate each next pointer to point to its next right node. If there is no nex
阅读全文
摘要:116. Populating Next Right Pointers in Each Node You are given a perfect binary tree where all leaves are on the same level, and every parent has two
阅读全文
摘要:115. Distinct Subsequences Given a string S and a string T, count the number of distinct subsequences of S which equals T. A subsequence of a string i
阅读全文
摘要:114. Flatten Binary Tree to Linked List Given a binary tree, flatten it to a linked list in-place. For example, given the following tree: The flattene
阅读全文
摘要:113. Path Sum II Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. Note: A leaf is a node with no
阅读全文
摘要:112. Path Sum Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals th
阅读全文
摘要:源码:编辑表单组件 组件源码(待优化)editForm.vue: <!-- 搜索表单 --> <template> <el-form ref='editForm' :size="size" inline :label-width="labelWidth" :model="editData" :rul
阅读全文
摘要:源码链接:弹窗组件 组件源码: <template> <transition name="el-fade-in"> <div v-if="modalCfg.visible" style="width:100%;height:100%;position:fixed;top:0px;left:0px;z
阅读全文
摘要:111. Minimum Depth of Binary Tree Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from t
阅读全文
摘要:110. Balanced Binary Tree Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: a bi
阅读全文
摘要:109. Convert Sorted List to Binary Search Tree Given a singly linked list where elements are sorted in ascending order, convert it to a height balance
阅读全文
摘要: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
阅读全文
摘要:107. Binary Tree Level Order Traversal II Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to righ
阅读全文
摘要:106. Construct Binary Tree from Inorder and Postorder Traversal Given inorder and postorder traversal of a tree, construct the binary tree. Note:You m
阅读全文
摘要:105. Construct Binary Tree from Preorder and Inorder Traversal Given preorder and inorder traversal of a tree, construct the binary tree. Note:You may
阅读全文
摘要:104. Maximum Depth of Binary Tree Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from th
阅读全文
摘要:103. Binary Tree Zigzag Level Order Traversal Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to rig
阅读全文
摘要:102. Binary Tree Level Order Traversal Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by l
阅读全文
摘要:101. Symmetric 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,
阅读全文
摘要:100. Same Tree Given two binary trees, write a function to check if they are the same or not. Two binary trees are considered the same if they are str
阅读全文
摘要:99. Recover Binary Search Tree Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its structure. Exa
阅读全文
摘要:98. Validate Binary Search Tree Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: The left
阅读全文
摘要:97. Interleaving String Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. Example 1: Example 2:
阅读全文
摘要:96. Unique Binary Search Trees Given n, how many structurally unique BST's (binary search trees) that store values 1 ... n? Example:
阅读全文
摘要:95. Unique Binary Search Trees II Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1 ... n. Example:
阅读全文
摘要:94. Binary Tree Inorder Traversal Given a binary tree, return the inorder traversal of its nodes' values. Example:
阅读全文
摘要:93. Restore IP Addresses Given a string containing only digits, restore it by returning all possible valid IP address combinations. Example:
阅读全文
摘要:92. Reverse Linked List II Reverse a linked list from position m to n. Do it in one-pass. Note: 1 ≤ m ≤ n ≤ length of list. Example:
阅读全文
摘要:91. Decode Ways A message containing letters from A-Z is being encoded to numbers using the following mapping: Given a non-empty string containing onl
阅读全文
摘要:90. Subsets II Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set). Note: The solution set
阅读全文
摘要:HTML: 1.严格模式与混杂模式如何区分?如何触发这两种模式? 2.html新特新,语义化的目的是什么?常用结构标签及其作用?谈谈对语义化的理解 3.常用浏览器内核 4.img的title和alt属性的区别 5.src和href的区别 6.<strong><em>和<b><i>标签的区别 7.你知
阅读全文
摘要:源码链接:查询表单组件 组件源码:searchForm.vue <!-- 搜索表单 --> <template> <div class="ces-search"> <el-form :size="size" inline :label-width="labelWidth"> <el-form-ite
阅读全文
摘要:element-ui表格封装的非常好,由于最近工作负责基础组件封装,封装更适合公司业务的复用组件,从表格开始: 源码链接:表格组件 组件源码:Table.vue <!--表格组件 --> <template> <section class="ces-table-page"> <!-- 表格操作按钮
阅读全文
摘要:89. Gray Code The gray code is a binary numeral system where two successive values differ in only one bit. Given a non-negative integer n representing
阅读全文
摘要:88. Merge Sorted Array Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1as one sorted array. Note: The number of elements initia
阅读全文
摘要:87. Scramble String Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one p
阅读全文
摘要:86. Partition List Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You s
阅读全文
摘要:85. Maximal Rectangle Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area. Example:
阅读全文
摘要:84. Largest Rectangle in Histogram Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the ar
阅读全文
摘要:83. Remove Duplicates from Sorted List Given a sorted linked list, delete all duplicates such that each element appear only once. Example 1: Example 2
阅读全文