原创 【LeetCode】238. 除去自身後,數組各項的乘積

問題描述Given an array nums of n integers where n > 1,  return an array output such that output[i] is equal to the product o

原创 【LeetCode】347. 前K個頻繁出現的元素

問題描述Given a non-empty array of integers, return thekmost frequent elements.Note:You may assumekis always valid, 1 ≤k≤ nu

原创 VATIC 視頻標註工具安裝與使用(非 docker)—— 2020-01-27 實現安裝

前言其實在網上有很多關於安裝和使用 VATIC (Video Annotation Tool from Irvine, California) 的博客和文章,只不過我自己在安裝的過程中,都會遇到各種各樣的問題,一方面是普遍的配置或者權限問題

原创 【LeetCode】101. 對稱樹

問題描述Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).Bonus points if you co

原创 【LeetCode】136. 單個的數字

問題描述Given anon-emptyarray of integers, every element appearstwiceexcept for one. Find that single one.Note:Your algorith

原创 【LeetCode】283. 移動所有的0元素

問題描述Given an arraynums, write a function to move all0's to the end of it while maintaining the relative order of the non

原创 【LeetCode】104. 二叉樹的最大深度

問題描述Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the

原创 【LeetCode】617. 合併兩個二叉樹

問題描述Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are

原创 【LeetCode】22. 有效的括號

問題描述Given a string containing just the characters'(',')','{','}','['and']', determine if the input string is valid.An in

原创 【LeetCode】543. 二叉樹的周長

問題描述Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is th

原创 【LeetCode】155. 小棧

問題描述Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push ele

原创 【LeetCode】338. 計算比特位的數目

問題描述Given a non negative integer numbernum. For every numbersiin the range0 ≤ i ≤ numcalculate the number of 1's in thei

原创 【LeetCode】226. 左右顛倒二叉樹

問題描述Invert a binary tree.顛倒一個二叉樹輸入: 4 / \ 2 7 / \ / \ 1 3 6 9 輸出: 4 / \ 7 2 /

原创 【LeetCode】169. 主要元素

問題描述Given an array of sizen, find the majority element. The majority element is the element that appearsmore than⌊ n/2 ⌋

原创 【LeetCode】53. 最大子序列

問題描述Given an integer arraynums, find the contiguous subarray (containing at least one number) which has the largest sum