56. Merge Intervals
摘要:description: Given a collection of intervals, merge all overlapping intervals.. Note: Example: answer: class Solution { public: vector merge(vector &
阅读全文
begin again
摘要:今天,很神奇,和妈妈共用一个耳机一起散步听了妈妈的歌单 妈妈应该是没有看过 begin again 的 神奇神奇
阅读全文
55. Jump Game
摘要:description: 看是否能跳到最后. Note: Example: answer: relative point get√: hint : 就是一直维护一个最远距离
阅读全文
54. Spiral Matrix
摘要:description: 螺旋输出一个矩阵. Note: Example: answer: relative point get√: hint :
阅读全文
53. Maximum Subarray
摘要:description: Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
阅读全文
52. N-Queens II
摘要:description: 八皇后 Note: Example: answer: class Solution { public: int totalNQueens(int n) { int res = 0; vector pos(n, 1); helper(pos, 0, res); return
阅读全文
51. N-Queens
摘要:description: 八皇后 Note: Example: answer: relative point get√: string(int n,char c); //用n个字符c初始化 hint :
阅读全文
1. 赋值运算符函数
摘要:https://github.com/zhulintao/CodingInterviewChinese2/blob/master/01_AssignmentOperator/AssignmentOperator.cpp 题目: 为 CMyString 类型添加赋值运算符函数 note: 把3返回值的
阅读全文
50. Pow(x, n)
摘要:description: Implement pow(x, n), which calculates x raised to the power n (xn). Note: Note: 100.0 0) return half half x; else return half half / x; /
阅读全文
49. Group Anagrams
摘要:description: Given an array of strings, group anagrams together Note: Note: All inputs will be in lowercase. The order of your output does not matter.
阅读全文
48. Rotate Image
摘要:description: You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Note: You have to rotate the image in
阅读全文
47. Permutations II
摘要:description: Given a collection of numbers that might contain duplicates, return all possible unique permutations. Note: You can assume that you can a
阅读全文
46. Permutations **
摘要:description: Given a collection of distinct integers, return all possible permutations. Note: You can assume that you can always reach the last index.
阅读全文
45. Jump Game II
摘要:description: Given an array of non negative integers, you are initially positioned at the first index of the array. Each element in the array represen
阅读全文
44. Wildcard Matching
摘要:description: 匹配字符串,具体看例子 Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for '?' and ' '. '?' Matches an
阅读全文
43. Multiply Strings
摘要:description: Given two non negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string.
阅读全文
42. Trapping Rain Water [dp][stack]
摘要:description: Given n non negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap a
阅读全文
纪念第一次青海湖之行泡汤
摘要:七月不远 ————给青海湖请熄灭我的爱情 海子 七月不远 性别的诞生不远 爱情不远————马鼻子下 湖泊含盐 因此青海湖不远 湖畔一捆捆蜂箱 使我显得凄凄迷人 青草开满鲜花。 青海湖上 我的孤独如天堂的马匹 (因此 天堂的马匹不远) 我就是那个情种: 诗中吟唱的野花 天堂的马肚子里唯一含毒的野花 (
阅读全文
《Do Neural Dialog Systems Use the Conversation History Effectively? An Empirical Study》
摘要:https://zhuanlan.zhihu.com/p/73723782 请复制粘贴到markdown 查看器查看! Do Neural Dialog Systems Use the Conversation History Effectively? An Empirical Study ACL2
阅读全文
41. First Missing Positive
摘要:description: Given an unsorted integer array, find the smallest missing positive integer. Note: Your algorithm should run in O(n) time and uses consta
阅读全文
40. Combination Sum II **
摘要:description: 给定target, 求给定数列中找到几个数(其中的数不可以重复使用,且一组数有几个也不做限制)的和为target,和上面那个题一毛一样的,就改一下下标就行了,背下来背下来背下来~~~ Note: All numbers (including target) will be
阅读全文
39. Combination Sum
摘要:description: 给定target, 求给定数列中找到几个数(其中的数可以重复使用,且一组数有几个也不做限制)的和为target Note: https://www.cnblogs.com/grandyang/p/4606334.html Example: answer: class Sol
阅读全文
R 语言学习过程全记录 ~
摘要:RStudio介绍超详细的教程:https://www.jianshu.com/p/132919ca2ca9 前辈的心得:https://blog.csdn.net/kMD8d5R/article/details/78967610 管道:% % grep(pattern = "an", x, val
阅读全文
38. Count and Say
摘要:description: 就是看前面那个数有几个几,然后写一串。 Note: Example: answer: class Solution { public: string countAndSay(int n) { if (n
阅读全文
37. Sudoku Solver **
摘要:description: 数独 Note: Example: answer: class Solution { public: void solveSudoku(vector & board) { if (board.empty() || board.size() != 9 || board[0].
阅读全文
36. Valid Sudoku
摘要:description: 判断数独是否正确 Determine if a 9x9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules: Each row
阅读全文