JobShow裁员加班实况-微信小程序

行列转置一般由由行转为列，或者由列转为行。CREATE TABLE datasets.t_city( `province` String, `city` String, `createtime` DateTime, `city_level` Int8)ENGINE = MergeTree()ORDER BY provinceSETTINGS index_granularity = 8192； insert into t_city values.

Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations incandidateswhere the candidate numbers sum totarget.Each number incandidatesmay only be usedoncein the combination.Note:The solutio...

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 mustwrite an algorithm withO(log n)runtime complexity.Example 1:I...

前言在我们使用Flink DataStream API编写业务代码时，aggregate()算子和AggregateFunction无疑是非常常用的。编写一个AggregateFunction需要实现4个方法：public interface AggregateFunction<IN, ACC, OUT> extends Function, Serializable { ACC createAccumulator(); ACC add(IN value, ACC ac...

先keyby分组，使用计数窗口计算，实例：

AggregateFunction 比 ReduceFunction 更加的通用，它有三个参数:输入类型(IN)、累加器类型(ACC)和输出类型(OUT)。

jdk1.8，1 重写Comparable比较方法2 重写equals方法3 Long 与 Long equals,Long 与 Long == ,Long 与 long ==

Leetcode 22. Generate Parentheses - 生成指定数量的有效圆括号，比如输入2，输出()()、(())

Java list1=list2;list2=null ? list1=list2;list2.clear()?

Leetcode 412. Fizz Buzz-蜂鸣器；Given an integern, returna string arrayanswer(1-indexed) where:answer[i] == "FizzBuzz"ifiis divisible by3and5.answer[i] == "Fizz"ifiis divisible by3.answer[i] == "Buzz"ifiis divisible by5.answer[i] == i(a

public static void main(String[] args) { int[] crr = new int[200]; char a = 'a'; System.out.println(crr[a]);//0 System.out.println(crr[a]--);//0 System.out.println(crr[a] + 2);//1 /////////////////////...

Leetcode 242. Valid Anagram

Leetcode 171. Excel Sheet Column Number-Excel的列名转换为具体的数字AB->28,ZY->701

Given theheadof a singly linked list, group all the nodes with odd indices together followed by the nodes with even indices, and returnthe reordered list.Thefirstnode is consideredodd, and thesecondnode iseven, and so on.Note that the relative...

You are given aperfect binary treewhere all leaves are on the same level, and every parent has two children. The binary tree has the following definition:struct Node { int val; Node *left; Node *right; Node *next;}Populate each next pointe..

Write a function todelete a nodein a singly-linked list. You willnotbe given access to theheadof the list, instead you will be given access tothe node to be deleteddirectly.It isguaranteedthat the node to be deleted isnot a tail nodein the li...

Given theheadof a singly linked list, returntrueif it is a palindrome.Example 1:Input: head = [1,2,2,1]Output: trueExample 2:Input: head = [1,2]Output: falseConstraints:The number of nodes in the list is in the range[1, 105]....

Given theheadof a sorted linked list,delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. Returnthe linked listsortedas well.Example 1:Input: head = [1,2,3,3,4,4,5]Output: [1,2,5]Example 2:...

* 每次:head与head.next值相等时，pre.next = head.next * head与head.next值不相等时，pre=最后一个重复值，head=下一个值

flinksql的 / 的结果只会保留整数部分,flinksql 不支持 div运算符。hive、 mysql ： / 结果是小数， div 结果只会保留整数部分mysql> select 3/2 ;+--------+| 3/2 |+--------+| 1.5000 |+--------+1 row in set (0.00 sec)mysql> mysql> mysql> select 3 div 2 ;+---------+| 3 ..