海量技术面试题库,拥有算法、数据结构、系统设计等 1000+题目,帮助你高效提升编程技能,轻松拿下世界 IT 名企 Dream Offer。
DS Interview Question What’s the differences between the poission distribution and normal distribution? LeetCode Question Write a query in SQL to count the number available rooms. Sample table: room roomnumber | roomtype | blockfloor | blockcode | unavailable ---+---+---+---+--- 101 |...
1342. 将数字变成 0 的操作次数 - 给你一个非负整数 num ,请你返回将它变成 0 所需要的步数。 如果当前数字是偶数,你需要把它除以 2 ;否则,减去 1 。 示例 1: 输入:num = 14 输出:6 解释:步骤 1) 14 是偶数,除以 2 得到 7 。步骤 2) 7 是奇数,减 1 得到 6
Leetcode -- Day 20 & Day 21 & Day 27 & Day 31 Binary search in sorted ArrayQuestion 1Median of Two Sorted Arrays There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (...
转载自:LeetCode Question Difficulty Distribution 1 Two Sum 2 5 array sort set Two Pointers 2 Add Two Numbers 3 4 linked list Two Pointers Math 3 Longest Substring Without Repeating Characters 3 2 string Two Pointers hashtable 4 Median of Two Sorted Arrays 5 3 array Binary Search 5 Longest ...
IdQuestionDifficultyFrequencyData StructuresAlgorithms1Two Sum25array + setsort + two pointers2Add Two Numbers34linked listtwo pointers + math3Longest
当前节点无法知晓前一个节点的信息；如果增删改当前节点，上一个节点的next就得不到更新Question给你一...
Section 7: Google Array question: first bad version (Easy) Lecture 32 Introduction To The Problem And Brute Force Approach Lecture 33 Optimal Solution Intuition Lecture 34 Optimal solution pseudocode walkthrough Lecture 35 Implementing the code Section 8: Microsoft Math Question: Missing Number (Easy...
Question 给定两个大小为 m 和 n 的有序数组 nums1 和 nums2。 请你找出这两个有序数组的中位数,并且要求算法的时间复杂度为 O(log(m + n))。 你可以假设 nums1 和 nums2 不会同时为空。 ** 示例1:** nums1 = [1, 3] nums2 = [2] ...
class Solution { public int singleNumber(int[] nums) { // 1.任何数异或0都等于原数 // 2.相同的数异或为0 int res = 0; for (int value: nums) { res ^= value; } return res; } } 4.只出现一次的数字2 nowcoder.com/practice/e //num1,num2分别为长度为1的数组。传出参数 //将num1...