Lix7's Home

238. Product of Array Except Self My Submissions QuestionEditorial SolutionGiven an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the

Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.For example:Given nums = [1,

·

Implement strStr()

Min StackDesign a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) – Push element x onto stack. pop() – Removes the element on top of the stack. top() –

Given an integer n, return the number of trailing zeroes in n!. Note: Your solution should be in logarithmic time complexity. 解析： 只有2和5相乘才会出现0，其中整十也可以看做是2和5相乘的结果，所以，可以在n之前看看有多少个2以及多少个5就行了，又发现2的

Merge Sorted Array

Intersection of Two Linked

LeetCode