Leetcode
无码萌妹码代码
这个作者很懒,什么都没留下…
展开
-
【无标题】AtCoder Beginner Contest 224(A-F)
AtCoder Beginner Contest 224(A-F)知识点整理:题号知识点备注A无B无C图D基础DP矩阵最大路径和变种E状态机DPF状压DPG?H?A - QQ solver题意给你三个字符组成的乘法表达式, 求计算结果题解用scanf读入整数#include <bits/stdc++.h>using namespace std;int main() {原创 2021-12-21 21:49:49 · 1255 阅读 · 1 评论 -
1584D - Guess the Permutation & 交互题入门
1584D - Guess the Permutation & 交互题入门一、 交互题简介第一次做交互题,用了大概半天时间学习了交互题的概念和大致做法交互题跟一般题相反, 一般题目是系统给你输入数据, 让你输出答案, 系统判断答案是否正确而交互题则类似于电视节目中的猜数字, 你可以理解为后台有一些数据, 但是需要你去询问, 系统会根据你的询问给你答案, 需要你在规定的询问次数内得到答案并输出主要的思想是二分、三分、随机数,难点在于几乎无法本地自测交互题是special judge中的一种原创 2021-11-15 12:30:36 · 1820 阅读 · 0 评论 -
AtCoder Beginner Contest 227(A-F)
AtCoder Beginner Contest 227(A-F)知识点整理:题号知识点备注A模拟,数学B打表法C数学D二分,贪心E字符串,DP建议顺便做下leetcode 777FDP好题, 经典题的变形G数论Poj2992, 数据范围加大H图论,欧拉路,网络流本次比赛大概比之前的ABC难一个字母, C相当于D,D相当于E这样子.简单题A - Last CardN个人站成一圈, 从A号人开始依原创 2021-11-15 08:08:52 · 978 阅读 · 2 评论 -
AtCoder Beginner Contest 226 H - Random Kth Max
H - Random Kth Max题意:给你NNN个连续随机变量X1,X2...XnX_1,X_2...X_nX1,X2...Xn.其中XiX_iXi 在区间[Li,Ri][L_i,R_i][Li,Ri]内均匀分布,求第KKK大数的期望。题解:一、求解子问题先看这个子问题:NNN个连续随机变量X1,X2...XnX_1,X_2...X_nX1,X2...Xn都服从U(0,1)U(0, 1)U(0,1),求第kkk大的数的期望。我们在大学的**《概率论与数理统计》**学原创 2021-11-11 19:24:38 · 459 阅读 · 0 评论 -
菜鸟写给菜鸟的 ——LeetCode解题笔记 Easy-题目1:292. Nim Game
Easy-题目1:292. Nim Game 题目原文: You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who remo原创 2016-05-30 17:03:47 · 853 阅读 · 0 评论 -
菜鸟写给菜鸟的 ——LeetCode解题笔记 Easy-题目2:258. Add Digits
题目原文: Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one d原创 2016-05-30 19:42:14 · 588 阅读 · 0 评论 -
Easy-题目3:104. Maximum Depth of Binary Tree
题目原文: Given a binary tree, find its maximum depth. 题目大意: 给出一个二叉树,求最大高度。 题目分析: 若节点为空,则返回0,否则返回左子树和右子树高度的最大值+1(根节点的高度)。依然一行代码解决。 源码:(language:java)public class Solution { public int maxDepth(Tr原创 2016-05-30 19:44:58 · 417 阅读 · 0 评论 -
Easy-题目4:226. Invert Binary Tree
题目原文: Invert a binary tree. 4/ \ 2 7 / \ / \ 1 3 6 9 to 4 / \ 7 2 / \ / \ 9 6 3 1 Trivia: This problem was inspired by this original tweet by Max原创 2016-05-30 19:45:32 · 342 阅读 · 0 评论 -
Easy-题目5:237. Delete Node in a Linked List
题目原文: Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with v原创 2016-05-30 19:46:05 · 402 阅读 · 0 评论 -
Easy-题目6:283. Move Zeroes
题目原文: Given an array nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], after calling you原创 2016-05-30 19:46:56 · 503 阅读 · 0 评论 -
Easy-题目7:100. Same Tree
题目原文: Given two binary trees, write a function to check if they are equal or not. 题目大意: 判断两个二叉树是不是全等的。 题目分析: (1) 若两树都空,则全等。 (2) 若一树空一树不空,则不全等。 (3) 若两树的根节点对应的值不同则不全等。 (4) 递归判断左子树和右子树是否相等。 源码:(l原创 2016-05-30 19:47:25 · 380 阅读 · 0 评论 -
Easy-题目9:171. Excel Sheet Column Number
题目原文: Given a column title as appear in an Excel sheet, return its corresponding column number.For example:A -> 1B -> 2C -> 3...Z -> 26AA -> 27AB -> 28 题目大意: 把Excel中的列号转换成自然数的列号。 题目分析: 递归计算,原创 2016-05-30 19:52:24 · 488 阅读 · 0 评论 -
Easy-题目10:217. Contains Duplicate
题目原文: Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every elem原创 2016-05-30 19:53:28 · 373 阅读 · 0 评论 -
Easy-题目11:169. Majority Element
题目原文: Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the array is non-empty and the majority elemen转载 2016-05-30 19:54:23 · 339 阅读 · 0 评论 -
Easy-题目12:206. Reverse Linked List
题目原文: Reverse a singly linked list. 题目大意: 翻转单链表。 题目分析: 使用递归函数,先把头结点后面的链表翻转过来,再把头结点安到末尾即可。 源码:(language:c)struct ListNode* reverseList(struct ListNode* head) { if(!head || !head->next)原创 2016-05-30 19:54:52 · 263 阅读 · 0 评论 -
Easy-题目13:13. Roman to Integer
题目原文: Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999. 题目大意: 把1-3999之内的罗马数字转换为整数。 题目分析: 先用HashMap记录数字与字母的映射关系,再根据罗马数字的换算法则逐位进行转换。遇到40,4等原创 2016-05-30 19:55:28 · 245 阅读 · 0 评论 -
Easy-题目14:235.Lowest Common Ancestor of a Binary Search Tree
题目原文: Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined betw原创 2016-05-30 19:57:06 · 312 阅读 · 0 评论 -
Easy-题目15:191. Number of 1 Bits
题目原文: Write a function that takes an unsigned integer and returns the number of ’1’ bits it has (also known as the Hamming weight).For example, the 32-bit integer ’11’ has binary representation 000000原创 2016-05-30 19:58:11 · 404 阅读 · 0 评论 -
Easy-题目16:328. Odd Even Linked List
题目原文: Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.You should try to do it原创 2016-05-30 19:59:40 · 291 阅读 · 0 评论 -
Easy-题目17:83. Remove Duplicates from Sorted List
题目原文: Given a sorted linked list, delete all duplicates such that each element appear only once.For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1->2->3. 题目大意: 给出一个排序的单链表,删除所有重原创 2016-05-30 20:00:11 · 238 阅读 · 0 评论 -
Easy-题目18:70. Climbing Stairs
题目原文: You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? 题目大意: 你在爬一个n阶的楼梯,每次可以上1阶也原创 2016-05-30 20:01:17 · 288 阅读 · 0 评论 -
Easy-题目19:263. Ugly Number
题目原文: Write a program to check whether a given number is an ugly number. Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ugly si原创 2016-05-30 20:03:00 · 239 阅读 · 0 评论 -
Easy-题目20:202. Happy Number
题目原文: Write an algorithm to determine if a number is “happy”. A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squ原创 2016-05-30 20:06:37 · 287 阅读 · 0 评论 -
Easy-题目21:326. Power of Three
题目原文: Given an integer, write a function to determine if it is a power of three. Follow up: Could you do it without using any loop / recursion? 题目大意: 给出一个整数,判断是不是3的幂。 你能否不使用循环或者递归? 题目分析: 如果使用循环原创 2016-05-30 20:07:35 · 214 阅读 · 0 评论 -
Easy-题目22:231. Power of Two
题目原文: Given an integer, write a function to determine if it is a power of two. 题目大意: 给出一个整数,判断是不是2的幂。 题目分析: 跟上题如出一辙,但还有一种方法是利用位运算,即2的幂的最高位是1,其余位全是0这一性质,判断n和n-1按位与是否等于0来解决。@15-信安-L。 源码:(language:c原创 2016-05-30 20:08:12 · 221 阅读 · 0 评论 -
Easy-题目23:21. Merge Two Sorted Lists
题目原文: Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 题目大意: 把两个排序的链表合并成一个链表并仍然保持有序。 题目分析: (1) 如果一个链表是空原创 2016-05-30 20:08:40 · 393 阅读 · 0 评论 -
Easy-题目24:110. Balanced Binary Tree
题目原文: Given a binary tree, determine if it is height-balanced. 题目大意: 判断一个树是不是二叉平衡树。 题目分析: 二叉平衡树可递归定义如下: (1) 空树是平衡二叉树。 (2) 平衡二叉树的左子树和 右子树高度差不超过1,且左右子树都是平衡二叉树。 严格按此定义设计算法即可。 源码:(language:java)pu原创 2016-05-30 20:09:18 · 200 阅读 · 0 评论 -
Easy-题目25:101. Symmetric Tree
题目原文: Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). 题目大意: 给一个二叉树,判断它是不是沿中线轴对称的。 题目分析: (1) 空树是轴对称的。 (2) 轴对称的两棵子树tree1和tree2应满足以下递归条件: a) 对应值相等;原创 2016-05-30 20:09:59 · 284 阅读 · 0 评论 -
Easy-题目26:198. House Robber
题目原文: You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent原创 2016-05-30 20:11:11 · 412 阅读 · 0 评论 -
Easy-题目27:107.Binary Tree Level Order Traversal II
题目原文: Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root). 题目大意: 给出一个二叉树,求层次遍历结果。其中,层次靠后的先输出。 题目分析: 与普通原创 2016-05-30 20:12:50 · 325 阅读 · 0 评论 -
Easy-题目28:27.Remove Element
题目原文: Given an array and a value, remove all instances of that value in place and return the new length. The order of elements can be changed. It doesn’t matter what you leave beyond the new length.原创 2016-05-30 20:13:10 · 342 阅读 · 0 评论 -
Easy-题目29:26. Remove Duplicates from Sorted Array
题目原文: Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in place wi转载 2016-05-30 20:13:34 · 321 阅读 · 0 评论 -
Easy-题目30:66. Plus One
题目原文: Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant digit is at the head of the list. 题目大意: 对用各数位的数组表示一原创 2016-05-30 20:14:24 · 314 阅读 · 0 评论 -
Easy-题目32:172. Factorial Trailing Zeroes
题目原文: Given an integer n, return the number of trailing zeroes in n!. 题目大意: 给出正整数n,求n!末尾有几个0. 题目分析: trivial的做法是把n!求出来,然后除10直到余数不为0,但开销太大(使用BigInteger) 那么分析一下: (1)0的来源是2*5=10,那么将n!因式分解,有几个2*5就有几个转载 2016-05-30 20:18:47 · 256 阅读 · 0 评论 -
Easy-题目33:102. Binary Tree Level Order Traversal
题目原文: Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level). 题目大意: 按层次遍历二叉树。 题目分析: 与前面的Easy第27题类似,只是不用翻转最后的结果数组。 源码:(language:java)p原创 2016-05-30 20:19:46 · 279 阅读 · 0 评论 -
Easy-题目34:119. Pascal's Triangle II
题目原文: Given an index k, return the kth row of the Pascal’s triangle. 题目大意: 给出整数k,输出杨辉三角的第k行。 题目分析: 在Easy第31题上修改,求出前n行,但只返回最后一行。 源码:(language:java)public class Solution { public List<Integer>原创 2016-05-30 20:20:48 · 318 阅读 · 0 评论 -
Easy-题目31:118. Pascal's Triangle
题目原文: Given an integer n, return the number of trailing zeroes in n!. 题目大意: 给出正整数n,求n!末尾有几个0. 题目分析: trivial的做法是把n!求出来,然后除10直到余数不为0,但开销太大(使用BigInteger) 那么分析一下: (1)0的来源是2*5=10,那么将n!因式分解,有几个2*5就有几个转载 2016-05-30 20:15:45 · 314 阅读 · 0 评论 -
Easy-题目35:9. Palindrome Number
题目原文: Determine whether an integer is a palindrome. Do this without extra space. 题目大意: 判断一个数是不是回文整数,要求不使用额外空间。 题目分析: 没想到不使用额外空间的办法,两种程序都是判断原数和翻转数是否相等来判断。一个是在字符串上的判断,一个是在数上的判断。 源码:(language:c/pyth原创 2016-05-30 20:27:00 · 276 阅读 · 0 评论 -
Easy-题目36:112. Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example: Given the below binary tree and sum = 2原创 2016-05-30 20:27:44 · 265 阅读 · 0 评论 -
Easy-题目37:111. Minimum Depth of Binary Tree
题目原文: Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. 题目大意: 给一个二叉树,求最小深度。 最小深度指的是沿着最转载 2016-05-30 20:28:06 · 408 阅读 · 0 评论