上一页 1 ··· 6 7 8 9 10 11 12 13 14 ··· 17 下一页
摘要: 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 阅读全文
posted @ 2019-04-14 22:16 mingL 阅读(353) 评论(0) 推荐(1) 编辑
摘要: 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 阅读全文
posted @ 2019-04-14 22:14 mingL 阅读(163) 评论(0) 推荐(0) 编辑
摘要: 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 阅读全文
posted @ 2019-04-14 22:12 mingL 阅读(111) 评论(0) 推荐(0) 编辑
摘要: 97. Interleaving String Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. Example 1: Example 2: 阅读全文
posted @ 2019-04-14 22:09 mingL 阅读(124) 评论(0) 推荐(0) 编辑
摘要: 96. Unique Binary Search Trees Given n, how many structurally unique BST's (binary search trees) that store values 1 ... n? Example: 阅读全文
posted @ 2019-04-14 22:00 mingL 阅读(112) 评论(0) 推荐(0) 编辑
摘要: 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: 阅读全文
posted @ 2019-04-14 21:59 mingL 阅读(112) 评论(0) 推荐(0) 编辑
摘要: 94. Binary Tree Inorder Traversal Given a binary tree, return the inorder traversal of its nodes' values. Example: 阅读全文
posted @ 2019-04-14 21:56 mingL 阅读(194) 评论(0) 推荐(0) 编辑
摘要: 93. Restore IP Addresses Given a string containing only digits, restore it by returning all possible valid IP address combinations. Example: 阅读全文
posted @ 2019-04-14 21:54 mingL 阅读(123) 评论(0) 推荐(0) 编辑
摘要: 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: 阅读全文
posted @ 2019-04-14 21:48 mingL 阅读(132) 评论(0) 推荐(0) 编辑
摘要: 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 阅读全文
posted @ 2019-04-14 21:45 mingL 阅读(172) 评论(0) 推荐(0) 编辑
摘要: 90. Subsets II Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set). Note: The solution set 阅读全文
posted @ 2019-04-14 21:14 mingL 阅读(133) 评论(0) 推荐(0) 编辑
摘要: HTML: 1.严格模式与混杂模式如何区分?如何触发这两种模式? 2.html新特新,语义化的目的是什么?常用结构标签及其作用?谈谈对语义化的理解 3.常用浏览器内核 4.img的title和alt属性的区别 5.src和href的区别 6.<strong><em>和<b><i>标签的区别 7.你知 阅读全文
posted @ 2019-04-14 12:13 mingL 阅读(197) 评论(0) 推荐(0) 编辑
摘要: 源码链接:查询表单组件 组件源码:searchForm.vue <!-- 搜索表单 --> <template> <div class="ces-search"> <el-form :size="size" inline :label-width="labelWidth"> <el-form-ite 阅读全文
posted @ 2019-04-08 22:43 mingL 阅读(5564) 评论(1) 推荐(1) 编辑
摘要: element-ui表格封装的非常好,由于最近工作负责基础组件封装,封装更适合公司业务的复用组件,从表格开始: 源码链接:表格组件 组件源码:Table.vue <!--表格组件 --> <template> <section class="ces-table-page"> <!-- 表格操作按钮 阅读全文
posted @ 2019-04-08 22:18 mingL 阅读(7492) 评论(1) 推荐(1) 编辑
摘要: 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 阅读全文
posted @ 2019-04-07 22:00 mingL 阅读(135) 评论(0) 推荐(0) 编辑
摘要: 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 阅读全文
posted @ 2019-04-07 21:37 mingL 阅读(97) 评论(0) 推荐(0) 编辑
摘要: 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 阅读全文
posted @ 2019-04-07 21:27 mingL 阅读(139) 评论(0) 推荐(0) 编辑
摘要: 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 阅读全文
posted @ 2019-04-07 21:04 mingL 阅读(215) 评论(0) 推荐(0) 编辑
摘要: 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: 阅读全文
posted @ 2019-04-07 20:54 mingL 阅读(172) 评论(0) 推荐(0) 编辑
摘要: 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 阅读全文
posted @ 2019-04-07 20:36 mingL 阅读(89) 评论(0) 推荐(0) 编辑
上一页 1 ··· 6 7 8 9 10 11 12 13 14 ··· 17 下一页