Algorithm problem
Li_GaoGao
这个作者很懒,什么都没留下…
展开
-
牛客网刷题|复杂链表的复制
题目来源:牛客网链接网址题目描述输入一个复杂链表(每个节点中有节点值,以及两个指针,一个指向下一个节点,另一个特殊指针指向任意一个节点),返回结果为复制后复杂链表的head。(注意,输出结果中请不要返回参数中的节点引用,否则判题程序会直接返回空)解题思路:先保存一版正常链表复制随机链表使用递归和非递归的方法/*struct RandomListNode { in...原创 2019-03-17 12:25:32 · 258 阅读 · 0 评论 -
[Leetcode从零开刷]693. Binary Number with Alternating Bits
题目来源:leetcodeGiven a positive integer, check whether it has alternating bits: namely, if two adjacent bits will always have different values. 翻译: 给一个正数,检查它的二进位是否交替出现。 如5:则是101 .,返回正确 10:1010,返回正...原创 2018-03-01 00:06:57 · 207 阅读 · 0 评论 -
[Leetcode从零开刷]771. Jewels and Stones
Jewels and Stonesleetcode题目You’re given strings J representing the types of stones that are jewels, and S representing the stones you have. Each character in S is a type of stone you have. ...原创 2018-02-03 10:23:38 · 3544 阅读 · 0 评论 -
[Leetcode从零开刷]217. Contains Duplicate
题目来源leetcode题目Given an array of integers nums, write a method that returns the “pivot” index of this array.We define the pivot index as the index where the sum of the numbers to the left of ...原创 2018-02-08 17:21:51 · 168 阅读 · 0 评论 -
[Leetcode从零开刷]119. Pascal's Triangle II
题目来源leetcode题目要求:Given an index k, return the kth row of the Pascal’s triangle.For example, given k = 3, Return [1,3,3,1].Note: Could you optimize your algorithm to use only O(k) extra...原创 2018-02-28 10:11:57 · 143 阅读 · 0 评论 -
[Leetcode从零开刷]728. Self Dividing Numbers
题目来源: leetcode A self-dividing number is a number that is divisible by every digit it contains.For example, 128 is a self-dividing number because 128 % 1 == 0, 128 % 2 == 0, and 128 % 8 == 0.Als...原创 2017-12-24 11:17:20 · 228 阅读 · 0 评论 -
[Leetcode从零开刷]66. Plus One
题目来源leetcode题目:Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.You may assume the integer do not contain any leading zero, except the number ...原创 2018-02-09 18:02:05 · 140 阅读 · 0 评论 -
[Leetcode从零开刷]226. Invert Binary Tree
题目来源: leetcode Invert a binary tree. 翻译:颠倒一个二叉树 解题: 如果不是根节点不用交换。 代码如下,class Solution {public: TreeNode* invertTree(TreeNode* root) { if(!root) return root; else原创 2017-12-02 22:44:06 · 170 阅读 · 0 评论 -
121. Best Time to Buy and Sell Stock[Leetcode从零开刷]
题目来源:leetcode题目Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and sell o原创 2018-02-05 09:27:37 · 204 阅读 · 0 评论 -
747. Largest Number At Least Twice of Others[Leetcode从零开刷]
题目来源:leetcode题目In a given integer array nums, there is always exactly one largest element.Find whether the largest element in the array is at least twice as much as every other number in the原创 2018-02-04 22:53:20 · 201 阅读 · 0 评论 -
746. Min Cost Climbing Stairs[Leetcode从零开刷]
题目来源leetcode题目:On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed).Once you pay the cost, you can either climb one or two steps. You need to find minimum co原创 2018-02-04 22:33:37 · 130 阅读 · 0 评论 -
268. Missing Number[Leetcode从零开刷]
题目来源:leetcode题目:Given an array containing n distinct numbers taken from 0, 1, 2, …, n, find the one that is missing from the array.Example 1Input: [3,0,1] Output: 2 Example 2Input: [9,原创 2018-02-04 17:01:07 · 293 阅读 · 0 评论 -
[Leetcode从零开刷]804. Unique Morse Code Words
这是个新题,题目不是很难。 原题: International Morse Code defines a standard encoding where each letter is mapped to a series of dots and dashes, as follows: “a”maps to “.-“, “b” maps to “-…”, “c” maps to “-.-....原创 2018-06-04 12:23:00 · 254 阅读 · 0 评论 -
[Leetcode从零开刷]38. Count and Say
这个题的难点在于理解题意,一下子还真没有明白什么意思。 The count-and-say sequence is the sequence of integers with the first five terms as following: 1. 1 2. 11 3. 21 4. 1211 5. 111221这...原创 2018-06-23 12:09:58 · 132 阅读 · 0 评论 -
牛客网刷题|矩形覆盖
题目来源:牛客网 编程链接题目: 我们可以用2*1的小矩形横着或者竖着去覆盖更大的矩形。请问用n个2*1的小矩形无重叠地覆盖一个2*n的大矩形,总共有多少种方法?解析: 假设最后一块是竖着放的,则前面有f(n-1)种方法排满,图1 假设最后一块是横着放的,则前面只有f(n-2)种方法排满,图2 图三是不存在,不存在2*2的矩阵。 则公式很简单:f(...原创 2018-04-30 11:39:29 · 232 阅读 · 0 评论 -
Leetcode-链表大总结
链表简单题全部做完做个小总结:141、linked-list-cycle两个指针,一块一慢,若快指针能遇到慢指针则返回true160、tersection-of-two-linked-lists 两个不等的线段并起来最后的长度相同,用两个指针同时走就行或者:最朴素的想法,求长度,求差,再两个一起走,直到相等或者返回空203.remove-linked-list-elements.cp...原创 2018-12-05 22:33:52 · 289 阅读 · 0 评论 -
[leetcode_Medium]59.spiral-matrix-ii
题目:Given a positive integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.在牛客网上有个类似的题。那个题是给出一个矩阵,顺时针打印出来。这个是给一个整数,生成一个矩阵。例子:Example:Input: 3Output:[[ 1, 2, 3 ...原创 2018-09-20 23:35:44 · 160 阅读 · 0 评论 -
[leetcode_medium]Unique Paths II
最近刷题喜欢用github上的leetcode-cli刷题感觉不错.使用界面如下:也可以看到自己整体的刷题进度:第63题是第62题的提升.题目:A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).The robot can only move...原创 2018-09-23 10:56:37 · 159 阅读 · 0 评论 -
[Leetcode从零开刷]48. Rotate Image
题目来源:leetcode You have to rotate the image in-place, which means you have to modify the input 2D matrix directly. DO NOT allocate another 2D matrix and do the rotation.这个题目很经典:就是旋转二维数组。可以顺时针旋转也...原创 2018-07-26 12:20:24 · 132 阅读 · 0 评论 -
[Leetcode从零开刷]43. Multiply Strings
题目来源: leetcode 这道题很简单,就是想实现一个乘法。 如果小时候做,应该会更快。 Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string.例子1:...原创 2018-07-25 21:45:51 · 107 阅读 · 0 评论 -
[Leetcode从零开刷]40. Combination Sum II
和第39题是同宗同源。上次是数组没有重复数字,这次允许有重复数字: Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums t...原创 2018-07-24 23:13:29 · 104 阅读 · 0 评论 -
[Leetcode从零开刷]39. Combination Sum
题目来源:leetcode Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target...原创 2018-07-24 23:02:08 · 153 阅读 · 0 评论 -
[Leetcode从零开刷]16. 3Sum Closest
这个题很好理解,给一个数组,返回三个值求和和目标值最近的一个值。Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You...原创 2018-07-12 12:12:01 · 144 阅读 · 0 评论 -
[Leetcode从零开刷]29. Divide Two Integers
题目来源:leetcode 题目,写一个除法,不用操作符模运算,除法等。 Given two integers dividend and divisor, divide two integers without using multiplication, division and mod operator. Return the quotient after dividing di...原创 2018-07-16 22:52:08 · 147 阅读 · 0 评论 -
[Leetcode从零开刷]19. Remove Nth Node From End of List
题目来源: leetcode 题目:给一个链表,删除倒数N个节点: Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the linked list becomes 1->2->3->5.解析: 这个题...原创 2018-07-16 22:19:47 · 114 阅读 · 0 评论 -
628. Maximum Product of Three Numbers[Leetcode从零开刷]
题目来源leetcode题目原题:Given an integer array, find three numbers whose product is maximum and output the maximum product.Example 1: Input: [1,2,3] Output: 6 Example 2: Input: [1,2,3,4] Outpu原创 2018-02-04 16:08:06 · 189 阅读 · 0 评论 -
[Leetcode从零开刷]18. Pascal's Triangle
题目来源leetcode题目:Given numRows, generate the first numRows of Pascal’s triangle.For example, given numRows = 5, Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]]解答:...原创 2018-02-09 10:23:05 · 132 阅读 · 0 评论 -
[Leetcode从零开刷]682. Baseball Game
题目来源; leetcode You’re now a baseball game point recorder.Given a list of strings, each string can be one of the 4 following types:Integer (one round’s score): Directly represents the number of points原创 2018-01-03 22:15:49 · 233 阅读 · 0 评论 -
[Leetcode从零开刷]Maximum Binary Tree
题目来源 : leetcode Given an integer array with no duplicates. A maximum tree building on this array is defined as follow:The root is the maximum number in the array. The left subtree is the maximum tre原创 2018-01-03 22:07:47 · 195 阅读 · 0 评论 -
[Leetcode从零开刷]476. Number Complement
题目来源: leetcode:Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.Note: The given integer is guaranteed to fit within the原创 2017-12-22 15:30:58 · 138 阅读 · 0 评论 -
[Leetcode从零开刷]561. Array Partition I
题目来源: leetcode:Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), …, (an, bn) which makes sum of min(ai, bi) for all i from 1 to n as原创 2017-12-27 14:09:55 · 141 阅读 · 0 评论 -
[Leetcode从零开刷]500. Keyboard Row
这个题感觉上还是挺难的。 题目来源: leetcode: Given a List of words, return the words that can be typed using letters of alphabet on only one row’s of American keyboard like the image below.翻译,给出一列词组,其中找出一些词,这些词可以用美原创 2017-12-26 23:06:00 · 181 阅读 · 0 评论 -
[Leetcode从零开刷]657. Judge Route Circle
题目来源: leetcode: Initially, there is a Robot at position (0, 0). Given a sequence of its moves, judge if this robot makes a circle, which means it moves back to the original place.The move sequence is原创 2017-12-22 15:49:41 · 157 阅读 · 0 评论 -
[Leetcode从零开刷]9. Palindrome Number
题目来源: leetcode Determine whether an integer is a palindrome. Do this without extra spaceSome hints: Could negative integers be palindromes? (ie, -1) If you are thinking of converting the intege原创 2017-12-05 14:21:16 · 143 阅读 · 0 评论 -
[Leetcode从零开刷]7. Reverse Integer
题目来源leetcode Given a 32-bit signed integer, reverse digits of an integer. For example: 翻译: 给一个32位的无符号整数,反转整数的数字。解题:利用取余和取除数到底方法,一个整数一个整数的求。 没有考虑越界的问题,见答案上用到了另外一个语句。return (res<INT_MIN || res>INT_M原创 2017-12-04 10:26:02 · 209 阅读 · 0 评论 -
[Leetcode从零开刷]389. Find the Difference
题目来源 leetcode Given two strings s and t which consist of only lowercase letters. String t is generated by random shuffling string s and then add one more letter at a random position. Find the lette原创 2017-12-11 11:56:38 · 165 阅读 · 0 评论 -
[Leetcode从零开刷]258. Add Digits
题目来源leetcode 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 h原创 2017-12-01 11:06:20 · 155 阅读 · 0 评论 -
[Leetcode从零开刷]617. Merge Two Binary Trees
一开始做的题目都不难,但是感觉坚持做下去,还挺有意思的,可以比较各种人的思路和想法,到目前为止还没有哪个题时不看答案做出来的,但是总会有的。虽然找的工作和算法 计算机不再 有交集,但算法练习,还是希望自己能每天坚持下去,一个是巩固学习c++的基本语法,一个是多思考算法的思路,多动脑筋挺不错的。保持活力和思考力很重要的。既然这样的话,以后也不费很多时间写翻译什么的,最主要是写题 和原创 2017-12-26 20:19:34 · 196 阅读 · 0 评论 -
[Leetcode从零开刷]292.Nim Game
题目来源 leetdoe: 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原创 2017-11-29 17:47:15 · 246 阅读 · 0 评论 -
[Leetcode从零开刷]461. Hamming Distance
题目来源:leetcode:The Hamming distance between two integers is the number of positions at which the corresponding bits are different.Given two integers x and y, calculate the Hamming distance.Note原创 2017-12-27 20:38:06 · 160 阅读 · 0 评论