*博客头图：

RGB颜色，例如：#AFAFAF

Hover：

RGB颜色，例如：#AFAFAF

RGB颜色，例如：#AFAFAF

杨鑫newlife的专栏

• 博客(2407)
• 资源 (192)
• 收藏
• 关注

原创 数据仓库Build The Data Warehouse（William H.Inmon）学习笔记目录

Inmon是经典的范式建模大师，该笔记目录是数据仓库Build The Data Warehouse（William H.Inmon）的学习笔记，内容包含书内的经典干货、随手结合实际经验的笔记心得；有相关的数据仓库建模问题可以私聊我讨论，互相学习！--- 文章持续更新中！---第一章数据仓库Build The Data Warehouse（William H.Inmon）学习笔记 --- 第一章、决策支持系统的发展第二章数据仓库Build The Data W...

2020-07-16 15:44:41 1648

原创 设计模式学习笔记汇总目录

2020-04-28 21:08:53 1094

原创 大数据之路、阿里巴巴大数据实践读书笔记目录

2020-01-12 02:09:19 1948

原创 送给订阅我专栏同学们一封信

2020-01-05 19:55:40 2108 2

原创 LeetCode --- 2073. Time Needed to Buy Tickets 解题报告

There are people in a line queuing to buy tickets, where the person is at the front of the line and the person is at the back of the line.You are given a 0-indexed integer array of length where the number of tickets that the person would like to buy

2024-06-16 23:56:32 23

原创 LeetCode --- 2068. Check Whether Two Strings are Almost Equivalent 解题报告

Two strings and are considered almost equivalent if the differences between the frequencies of each letter from to between and is at most .Given two strings and , each of length , return if and are almost equivalent, or otherwise.The frequency o

2024-03-16 14:16:31 129

原创 LeetCode --- 2062. Count Vowel Substrings of a String 解题报告

A substring is a contiguous (non-empty) sequence of characters within a string.A vowel substring is a substring that only consists of vowels (, , , , and ) and has all five vowels present in it.Given a string , return the number of vowel substrings in .Exa

2024-03-14 08:08:23 113

原创 LeetCode --- 2057. Smallest Index With Equal Value 解题报告

Given a 0-indexed integer array , return the smallest index of such that , or if such index does not exist. denotes the remainder when is divided by .Example 1:Input: nums = [0,1,2]Output: 0Explanation: i=0: 0 mod 10 = 0 == nums[0].i=1: 1 mod 10 =

2024-03-14 07:48:04 174

原创 LeetCode --- 2053. Kth Distinct String in an Array 解题报告

A distinct string is a string that is present only once in an array.Given an array of strings , and an integer , return the distinct string present in . If there are fewer than distinct strings, return an empty string .Note that the strings are considere

2024-03-05 07:35:58 108 1

原创 LeetCode --- 2047. Number of Valid Words in a Sentence 解题报告

LeetCode --- 2047. Number of Valid Words in a Sentence 解题报告

2024-02-17 03:18:58 239

原创 LeetCode --- 2042. Check if Numbers Are Ascending in a Sentence 解题报告

A sentence is a list of tokens separated by a single space with no leading or trailing spaces. Every token is either a positive number consisting of digits with no leading zeros, or a word consisting of lowercase English letters.Given a string representi

2024-02-02 00:14:14 103

原创 LeetCode --- 2037. Minimum Number of Moves to Seat Everyone 解题报告

There are seats and students in a room. You are given an array of length , where is the position of the seat. You are also given the array of length , where is the position of the student.You may perform the following move any number of times:Retur

2024-02-01 23:58:54 242

原创 LeetCode --- 2032. Two Out of Three 解题报告

Given three integer arrays , , and , return a distinct array containing all the values that are present in at least two out of the three arrays. You may return the values in any order.Example 1:Input: nums1 = [1,1,3,2], nums2 = [2,3], nums3 = [3]Output:

2024-01-31 22:04:24 159

原创 LeetCode --- 2027. Minimum Moves to Convert String 解题报告

You are given a string consisting of characters which are either or .A move is defined as selecting three consecutive characters of and converting them to . Note that if a move is applied to the character , it will stay the same.Return the minimum numb

2024-01-31 21:45:47 145

原创 LeetCode --- CodeTestcaseTest ResultTest Result2022. Convert 1D Array Into 2D Array 解题报告

2024-01-19 01:58:54 43

原创 LeetCode --- 2016. Maximum Difference Between Increasing Elements 解题报告

LeetCode升序求差值

2024-01-15 01:56:58 118

原创 LeetCode --- 2011. Final Value of Variable After Performing Operations 解题报告

There is a programming language with only four operations and one variable :Initially, the value of is .Given an array of strings containing a list of operations, return the final value of after performing all the operations.Example 1:Input: operations

2023-12-10 23:55:52 149

原创 LeetCode --- 2006. Count Number of Pairs With Absolute Difference K 解题报告

Given an integer array and an integer , return the number of pairs where such that .The value of is defined as:Example 1:Input: nums = [1,2,2,1], k = 1Output: 4Explanation: The pairs with an absolute difference of 1 are:- [1,2,2,1]- [1,2,2,1]- [1

2023-12-10 23:44:34 136

原创 LeetCode --- 2000. Reverse Prefix of Word 解题报告

Given a 0-indexed string and a character , reverse the segment of that starts at index and ends at the index of the first occurrence of (inclusive). If the character does not exist in , do nothing.Return the resulting string.Example 1:Input: word = &

2023-12-03 12:20:01 214

原创 LeetCode --- 1995. Count Special Quadruplets 解题报告

2023-11-11 11:22:36 177

原创 LeetCode --- CodeTestcaseTestcaseTest Result1991. Find the Middle Index in Array 解题报告

Given a 0-indexed integer array , find the leftmost (i.e., the smallest amongst all the possible ones).A is an index where .If , the left side sum is considered to be . Similarly, if , the right side sum is considered to be .Return the leftmost that sat

2023-11-05 23:27:30 103

原创 LeetCode --- 1984. Minimum Difference Between Highest and Lowest of K Scores 解题报告

You are given a 0-indexed integer array , where represents the score of the student. You are also given an integer .Pick the scores of any students from the array so that the difference between the highest and the lowest of the scores is minimized.Retu

2023-11-03 08:48:14 91

原创 LeetCode --- 1979. Find Greatest Common Divisor of Array 解题报告

Given an integer array , return the greatest common divisor of the smallest number and largest number in .The greatest common divisor of two numbers is the largest positive integer that evenly divides both numbers.Example 1:Input: nums = [2,5,6,9,10]Outp

2023-10-23 00:18:16 256

原创 LeetCode --- 1974. Minimum Time to Type Word Using Special Typewriter 解题报告

There is a special typewriter with lowercase English letters to arranged in a circle with a pointer. A character can only be typed if the pointer is pointing to that character. The pointer is initially pointing to the character .Each second, you may perf

2023-10-20 00:12:17 582

原创 LeetCode --- 1971. Find if Path Exists in Graph 解题报告

2023-10-09 23:19:16 573

原创 LeetCode --- 1967. Number of Strings That Appear as Substrings in Word 解题报告

Given an array of strings and a string , return the number of strings in that exist as a substring in .A substring is a contiguous sequence of characters within a string.Example 1:Input: patterns = ["a","abc","bc","d&q

2023-09-25 01:06:53 476

原创 LeetCode --- 1961. Check If String Is a Prefix of Array 解题报告

Given a string and an array of strings , determine whether is a prefix string of .A string is a prefix string of if can be made by concatenating the first strings in for some positive no larger than .Return if is a prefix string of , or otherwis

2023-09-25 00:51:33 285

原创 LeetCode --- 1957. Delete Characters to Make Fancy String 解题报告

A fancy string is a string where no three consecutive characters are equal.Given a string , delete the minimum possible number of characters from to make it fancy.Return the final string after the deletion. It can be shown that the answer will always be u

2023-09-24 10:55:41 137

原创 LeetCode --- 1952. Three Divisors 解题报告

Given an integer , return if has exactly three positive divisors. Otherwise, return .An integer is a divisor of if there exists an integer such that .Example 1:Input: n = 2Output: falseExplantion: 2 has only two divisors: 1 and 2.Example 2:Inpu

2023-09-24 10:33:02 121

原创 LeetCode --- 222. Count Complete Tree Nodes 解题报告

Given the of a complete binary tree, return the number of the nodes in the tree.According to Wikipedia, every level, except possibly the last, is completely filled in a complete binary tree, and all nodes in the last level are as far left as possible. It

2023-09-23 20:10:58 209

原创 LeetCode --- 145. Binary Tree Postorder Traversal 解题报告

Given the of a binary tree, return the postorder traversal of its nodes' values.Example 1:Input: root = [1,null,2,3]Output: [3,2,1]Example 2:Input: root = []Output: []Example 3:Input: root = [1]Output: [1]Constraints:Follow up: Recursive so

2023-09-23 19:34:38 134

原创 LeetCode --- 1945. Sum of Digits of String After Convert 解题报告

You are given a string consisting of lowercase English letters, and an integer .First, convert into an integer by replacing each letter with its position in the alphabet (i.e., replace with , with , ..., with ). Then, transform the integer by replacin

2023-09-23 16:58:28 140

原创 LeetCode --- 1941. Check if All Characters Have Equal Number of Occurrences 解题报告

Given a string , return if is a good string, or otherwise.A string is good if all the characters that appear in have the same number of occurrences (i.e., the same frequency).Example 1:Input: s = "abacbc"Output: trueExplanation: The chara

2023-09-23 02:36:32 68

原创 LeetCode --- 1935. Maximum Number of Words You Can Type 解题报告

There is a malfunctioning keyboard where some letter keys do not work. All other keys on the keyboard work properly.Given a string of words separated by a single space (no leading or trailing spaces) and a string of all distinct letter keys that are brok

2023-09-10 10:58:05 555

原创 LeetCode --- 1929. Concatenation of Array 解题报告

Given an integer array of length , you want to create an array of length where and for (0-indexed).Specifically, is the concatenation of two arrays.Return the array .Example 1:Input: nums = [1,2,1]Output: [1,2,1,1,2,1]Explanation: The array ans

2023-09-10 10:39:15 322

原创 LeetCode --- 1925. Count Square Sum Triples 解题报告

A square triple is a triple where , , and are integers and .Given an integer , return the number of square triples such that .Example 1:Input: n = 5Output: 2Explanation: The square triples are (3,4,5) and (4,3,5).Example 2:Input: n = 10Output: 4

2023-09-05 01:59:00 290

原创 LeetCode --- 1920. Build Array from Permutation 解题报告

Given a zero-based permutation (0-indexed), build an array of the same length where for each and return it.A zero-based permutation is an array of distinct integers from to (inclusive).Example 1:Input: nums = [0,2,1,5,3,4]Output: [0,1,2,4,5,3]Exp

2023-09-05 01:36:23 294

原创 LeetCode --- 1913. Maximum Product Difference Between Two Pairs 解题报告

The product difference between two pairs and is defined as .Given an integer array , choose four distinct indices , , , and such that the product difference between pairs and is maximized.Return the maximum such product difference.Example 1:Input: nu

2023-09-03 03:07:36 395

原创 LeetCode --- 1909. Remove One Element to Make the Array Strictly Increasing 解题报告

Given a 0-indexed integer array , return if it can be made strictly increasing after removing exactly one element, or otherwise. If the array is already strictly increasing, return .The array is strictly increasing if for each index Example 1:Input: n

2023-09-03 02:40:04 138

原创 LeetCode --- 1903. Largest Odd Number in String 解题报告

You are given a string , representing a large integer. Return the largest-valued odd integer (as a string) that is a non-empty substring of , or an empty string if no odd integer exists.A substring is a contiguous sequence of characters within a string.Ex

2023-08-29 08:10:53 339

2022-06-19

An Introduction to HTAP

An Introduction to HTAP

2022-04-26

2021-08-22

ImpalaJDBC

2021-08-22

hive_jdbc_2.6.2.1002.zip

hive_jdbc_2.6.2.1002

2021-08-22

ClouderaHiveODBC

2021-08-22

2020-07-22

JVM内存管理知识思维导图.png

JVM内存管理知识思维导图.png

2020-05-22

2020-02-29

2020-01-20

2019-12-19

Griffin数据质量管理技术调研.pdf

Griffin数据质量管理技术调研.pdf

2019-12-09

Kylin多维分析.pdf

2019-12-05

CDH5.17版本Hue接入HBase步骤.pdf

CDH5.17版本Hue接入HBase步骤.pdfC

2019-11-28

Apache Kylin竞品分析.pdf

Apache Kylin竞品分析.pdf

2019-11-18

2019-11-18

_bz2.cpython-36m-x86_64-linux-gnu.so

_bz2.cpython-36m-x86_64-linux-gnu.so,

2019-11-07

presto-cli-0.223-executable.jar

presto-cli-0.223-executable.jar

2019-11-07

2019-11-04

Cloudera Manager-V5.13 元数据库梳理.pdf

Cloudera Manager-V5.13 元数据库梳理.pdfCloudera Manager-V5.13 元数据库梳理.pdfCloudera Manager-V5.13 元数据库梳理.pdfCloudera Manager-V5.13 元数据库梳理.pdfCloudera Manager-V5.13 元数据库梳理.pdfCloudera Manager-V5.13 元数据库梳理.pdfCloudera Manager-V5.13 元数据库梳理.pdf

2019-10-30

2019-10-17

2019-10-17

2019-10-17

KNN实现水果分类的数据集

KNN实现水果分类的数据集KNN实现水果分类的数据集，KNN实现水果分类的数据集，KNN实现水果分类的数据集

2019-10-17

2019-09-21

ML-朴素贝叶斯-2019-07-01.pdf

ML-朴素贝叶斯-2019-07-01.pdf

2019-07-02

udfs-2.0.4-SNAPSHOT.jar

Presto的UDF函数，基本可以覆盖Hive的大多数情况。

2019-06-26

Python3实现KNN的三个例子（包含数据集），水果分类，识别手写数字，找相似的朋友

Python3实现KNN的三个例子（包含数据集），水果分类，识别手写数字，找相似的朋友

2019-03-06

Presto资源管理Rest API 文档

Presto资源管理Rest API 文档

2018-12-01

ACM学习路线导图

2018-11-14

2018-11-07

Kylin调研报告

Kylin (MOLAP - Multidimensional OnlineAnalytical Processing)调研报告

2018-10-29

ALL in python学习PPT

ALL in python学习PPT

2018-10-28

presto-cli

presto-cli,presto-cli,

2018-10-22

python pep8编码规范

2018-10-17

Confluence-5.6.6-language-pack-zh_CN.jar

Confluence-5.6.6-language-pack-zh_CN.jar，防止confluence乱码的jar包

2018-09-30

AzkabanAPI接口文档汇总

2018-09-26

MachineLearning-相似度距离公式

MachineLearning-相似度距离公式

2018-09-21

Azkaban元数据库分析，

2018-09-19