正在沿着IT树往上爬-优快云博客

名称git-config - 获取并设置仓库或者全局选项概要git config [<file-option>] [--type=<type>] [--fixed-value] [--show-origin] [--show-scope] [-z|--null] <name> [<value> [<value-pattern>]]git config [<file-option>] [--type=<type>] -

2022-04-28 16:57:39 513

翻译【git命令】git

名称git - 傻瓜式的内容跟踪器概要git [--version] [--help] [-C <path>] [-c <name>=<value>] [--exec-path[=<path>]] [--html-path] [--man-path] [--info-path] [-p|--paginate|-P|--no-pager] [--no-replace-objects] [--bare] [--git-dir=<

2022-04-28 11:24:32 342

原创【Best Time to Buy and Sell Stock IV】

You are given an integer array prices where prices[i] is the price of a given stock on the ith day, and an integer k.Find the maximum profit you can achieve. You may complete at most k transactions.Note: You may not engage in multiple transactions simult

2022-04-26 10:59:10 1024

原创【Best Time to Buy and Sell Stock III】

You are given an array prices where prices[i] is the price of a given stock on the ith day.Find the maximum profit you can achieve. You may complete at most two transactions.Note: You may not engage in multiple transactions simultaneously (i.e., you must

2022-04-26 10:52:27 648

原创【Best Time to Buy and Sell Stock II】

You are given an integer array prices where prices[i] is the price of a given stock on the ith day.On each day, you may decide to buy and/or sell the stock. You can only hold at most one share of the stock at any time. However, you can buy it then immedia

2022-04-24 15:45:26 617

原创【Best Time to Buy and Sell Stock】

You are given an array prices where prices[i] is the price of a given stock on the ith day.You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.Return the maximum profit

2022-04-24 14:30:04 502

原创数仓分层的意义及通用设计

文章目录为什么要设计数据分层数仓分层的意义通用的数仓分层设计总结为什么要设计数据分层大多数情况下，我们完成的数据体系依赖复杂、层级混乱，在不知不觉中，容易出现循环依赖体系。因此，我们需要设计一套有效的组织方式和管理办法使得对数据有一个更加清晰的掌控。数仓分层的意义清晰数据结构：每一个数据分层都有它的作用域和职责，在使用表的时候能更方便地定位和理解减少重复开发：规范数据分层，开发一些通用的中间层数据，能够极大减少的重复计算保障数据质量：通过数据分层，提供统一的数据出口，统一对外输出的数据口径，减

2022-04-21 17:40:10 2245

原创【Pascal‘s Triangle】

Given an integer numRows, return the first numRows of Pascal’s triangle.In Pascal’s triangle, each number is the sum of the two numbers directly above it as shown:Example 1:Input: numRows = 5Output: [[1],[1,1],[1,2,1],[1,3,3,1],[1,4,6,4,1]]Example 2

2022-04-19 17:31:52 768

原创【Path Sum】

Given the root of a binary tree and an integer targetSum, return true if the tree has a root-to-leaf path such that adding up all the values along the path equals targetSum.A leaf is a node with no children.Example 1:Input: root = [5,4,8,11,null,13,4,7

2022-04-19 16:58:48 332

原创【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 the root node down to the nearest leaf node.Note: A leaf is a node with no children.Example 1:Input: root = [3,9,20,null,null,15,7]Outpu

2022-04-18 17:43:39 295

转载【Freedom Trail】

In the video game Fallout 4, the quest “Road to Freedom” requires players to reach a metal dial called the “Freedom Trail Ring” and use the dial to spell a specific keyword to open the door.Given a string ring that represents the code engraved on the oute

2022-04-18 15:36:04 124

原创【Max Area of Island】

You are given an m x n binary matrix grid. An island is a group of 1’s (representing land) connected 4-directionally (horizontal or vertical.) You may assume all four edges of the grid are surrounded by water.The area of an island is the number of cells w

2022-04-12 16:07:02 103

原创【Count Good Nodes in Binary Tree】

Given a binary tree root, a node X in the tree is named good if in the path from root to X there are no nodes with a value greater than X.Return the number of good nodes in the binary tree.Example 1:Input: root = [3,1,4,3,null,1,5]Output: 4Explanatio

2022-04-11 17:07:52 419

原创【Convert Sorted Array to Binary Search Tree】

Given an integer array nums where the elements are sorted in ascending order, convert it to a height-balanced binary search tree.A height-balanced binary tree is a binary tree in which the depth of the two subtrees of every node never differs by more than

2022-04-08 18:16:02 417

原创【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 binary tree in which the left and right subtrees of every node differ in height by no more than 1.Example 1:Input: root = [3,9,20

2022-04-08 11:00:40 106

原创【Maximum Depth of Binary Tree】

Given the root of a binary tree, return its maximum depth.A binary tree’s maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.Example 1:Input: root = [3,9,20,null,null,15,7]Output: 3Example 2

2022-04-06 18:14:18 447

原创【Symmetric Tree】

Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).Example 1:Input: root = [1,2,2,3,4,4,3]Output: trueExample 2:Input: root = [1,2,2,null,3,null,3]Output: falseConstraints:The number of

2022-04-02 18:26:53 431

原创【Same Tree】

Given the roots of two binary trees p and q, write a function to check if they are the same or not.Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.Example 1:Input: p = [1,2,3], q = [1,2,3]

2022-04-02 16:09:18 523

原创【一维数组构建二叉树】

class Solution { /** * 一维数组构建二叉树 * * @param objects * @return */ public TreeNode createBinaryTree(Object[] objects) { Queue<TreeNode> queue = new LinkedList<TreeNode>(); TreeNode head; if

2022-04-01 17:26:15 569

原创【Binary Tree Inorder Traversal】

Given the root of a binary tree, return the inorder traversal of its nodes’ values.Example 1:Input: root = [1,null,2,3]Output: [1,3,2]Example 2:Input: root = []Output: []Example 3:Input: root = [1]Output: [1]Constraints:The number of nodes

2022-03-31 17:31:26 365

原创【Merge Sorted Array】

You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively.Merge nums1 and nums2 into a single array sorted in non-decreasing order.The f

2022-03-29 18:08:48 104

原创【Remove Duplicates from Sorted List】

Given the head of a sorted linked list, delete all duplicates such that each element appears only once. Return the linked list sorted as well.Example 1:Input: head = [1,1,2]Output: [1,2]Example 2:Input: head = [1,1,2,3,3]Output: [1,2,3]Constrain

2022-03-29 14:58:09 243

原创【 Climbing Stairs】

You are climbing a staircase. It takes n steps to reach the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?Example 1:Input: n = 2Output: 2Explanation: There are two ways to climb to the top.1. 1 st

2022-03-29 11:03:46 112

原创【Add Two Numbers】-（Java）

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.You may assume the two number

2022-03-25 18:15:24 534

转载【MYSQL数据库基础之Join操作原理】

Join使用的是Nested-Loop Join算法，Nested-Loop Join(NLJ)有三种select * from t1 join t2 on t1.a = t2.a;-- a 100条数据, b 1000条数据Simple Nested-Loop Join会遍历t1全表，t1作为驱动表，t1中的每一条数据都会到t2中做一次全表查询，该过程会比较100*1000次。每次在t2中做全表查询时，全表扫描可就不保证在内存里了，Buffer Pool会淘汰，有可能在磁盘。Block Ne

2022-02-25 18:12:18 249

原创【Add Binary】-（Java）

Given two binary strings a and b, return their sum as a binary string.Example 1:Input: a = "11", b = "1"Output: "100"Example 2:Input: a = "1010", b = "1011"Output: "10101"Constraints:1 <= a.length, b.length <= 10^4a and b consist only of

2022-01-19 11:15:09 132

转载 cassandra-压缩策略

参考：https://blog.youkuaiyun.com/weixin_34178244/article/details/92846253Cassandra的存储机制借鉴了Bigtable的设计，采用Memtable和SSTable的方式。和关系数据库一样，Cassandra在写数据之前，也需要先记录日志，称之为commitlog（数据库中的commit log 分为 undo-log, redo-log 以及 undo-redo-log 三类，由于 cassandra采用时间戳识别新老数据而不会覆盖已有的数据，

2022-01-18 16:53:34 1239

原创【Add Binary】-（Python）

Given two binary strings a and b, return their sum as a binary string.Example 1:Input: a = "11", b = "1"Output: "100"Example 2:Input: a = "1010", b = "1011"Output: "10101"Constraints:1 <= a.length, b.length <= 10^4a and b consist only of

2022-01-05 18:16:40 156

原创【Plus One】-（Python）

You are given a large integer represented as an integer array digits, where each digits[i] is the ith digit of the integer. The digits are ordered from most significant to least significant in left-to-right order. The large integer does not contain any lea

2021-12-30 11:00:17 140

原创【Plus One】-（Java）

You are given a large integer represented as an integer array digits, where each digits[i] is the ith digit of the integer. The digits are ordered from most significant to least significant in left-to-right order. The large integer does not contain any lea

2021-12-30 10:39:19 145

原创【Length of Last Word】-（Python）

Given a string s consisting of some words separated by some number of spaces, return the length of the last word in the string.A word is a maximal substring consisting of non-space characters only.Example 1:Input: s = "Hello World"Output: 5Explanation

2021-12-23 17:57:20 134

原创【Length of Last Word】-（Java）

Given a string s consisting of some words separated by some number of spaces, return the length of the last word in the string.A word is a maximal substring consisting of non-space characters only.Example 1:Input: s = "Hello World"Output: 5Explanation

2021-12-23 17:55:58 123

原创【Maximum Subarray】-（Python）

Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.A subarray is a contiguous part of an array.Example 1:Input: nums = [-2,1,-3,4,-1,2,1,-5,4]Output: 6Explanation: [

2021-12-23 17:35:28 232

原创【Maximum Subarray】-（Java）

Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.A subarray is a contiguous part of an array.Example 1:Input: nums = [-2,1,-3,4,-1,2,1,-5,4]Output: 6Explanation: [

2021-12-23 17:34:08 156

原创【Search Insert Position】-（Python）

Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You must write an algorithm with O(log n) runtime complexity.Example 1:Input:

2021-12-22 18:08:01 115

原创【Search Insert Position】-（Java）

Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You must write an algorithm with O(log n) runtime complexity.Example 1:Input:

2021-12-22 18:04:35 118

翻译 HDFS Erasure Coding

文章目录目标背景结构部署集群和硬件配置配置密钥管理员命令使用限制目标背景结构部署集群和硬件配置配置密钥管理员命令使用限制

2021-12-21 15:58:27 610

空空如也

空空如也