随笔分类 -  算法题

上一页 1 2 3 4 5 6
leetcode [60] Permutation Sequence
摘要：The set [1,2,3,...,n] contains a total of n! unique permutations. By listing and labeling all of the permutations in order, we get the following seque 阅读全文
posted @ 2019-03-29 10:07 小白兔云 阅读(151) 评论(0) 推荐(0)
leetcode [50] Pow(x, n)
摘要：Implement pow(x, n), which calculates x raised to the power n (x^n). Example 1: Input: 2.00000, 10 Output: 1024.00000 Example 2: Input: 2.10000, 3 Out 阅读全文
posted @ 2019-03-27 19:33 小白兔云 阅读(133) 评论(0) 推荐(0)
leetcode [48] Rotate Image
摘要：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-place, which 阅读全文
posted @ 2019-03-26 10:55 小白兔云 阅读(100) 评论(0) 推荐(0)
leetcode[47] Permutations II
摘要：Given a collection of numbers that might contain duplicates, return all possible unique permutations. Example: Input: [1,1,2] Output: [ [1,1,2], [1,2, 阅读全文
posted @ 2019-03-26 10:28 小白兔云 阅读(147) 评论(0) 推荐(0)
leetcode [43] Multiply Strings
摘要：Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string. Example 1: In 阅读全文
posted @ 2019-03-25 19:26 小白兔云 阅读(110) 评论(0) 推荐(0)
leetcode[40] Combination Sum II
摘要：Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numb 阅读全文
posted @ 2019-03-25 17:53 小白兔云 阅读(151) 评论(0) 推荐(0)
leetcode [39] Combination Sum
摘要：Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the  阅读全文
posted @ 2019-03-25 17:28 小白兔云 阅读(121) 评论(0) 推荐(0)
leetcode [34] Find First and Last Position of Element in Sorted Array
摘要：Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value. Your algorithm's runtime com 阅读全文
posted @ 2019-03-24 19:52 小白兔云 阅读(135) 评论(0) 推荐(0)
leetcode [33] Search in Rotated Sorted Array
摘要：Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]). Yo 阅读全文
posted @ 2019-03-24 19:42 小白兔云 阅读(150) 评论(0) 推荐(0)
leetcode [31] Next Permutation
摘要：Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possib 阅读全文
posted @ 2019-03-22 21:30 小白兔云 阅读(145) 评论(0) 推荐(0)
leetcode [29] Divide Two Integers
摘要：[29] Divide Two Integers https://leetcode.com/problems/divide-two-integers/description/Given two integers dividend and divisor, divide two integers wi 阅读全文
posted @ 2019-03-22 20:50 小白兔云 阅读(142) 评论(0) 推荐(0)
直角三角锥
摘要：链接：https://www.nowcoder.com/acm/contest/81/A来源：牛客网在三维空间中，平面 x = 0, y = 0, z = 0，以及平面 x + y + z = K 围成了一个三棱锥 整天与整数打交道的小明希望知道这个三棱锥内、上整点的数目。 他觉得数量可能很多，所以 阅读全文
posted @ 2018-04-21 13:44 小白兔云 阅读(548) 评论(0) 推荐(0)
1+2=3?
摘要：链接：https://www.nowcoder.com/acm/contest/91/F来源：牛客网 题目描述 小Y在研究数字的时候，发现了一个神奇的等式方程，他屈指算了一下有很多正整数x满足这个等式，比如1和2，现在问题来了，他想知道从小到大第N个满足这个等式的正整数，请你用程序帮他计算一下。 ( 阅读全文
posted @ 2018-04-19 23:52 小白兔云 阅读(523) 评论(0) 推荐(0)
Leetcode480-Sliding Window Median
摘要：Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two 阅读全文
posted @ 2018-04-15 00:17 小白兔云 阅读(154) 评论(0) 推荐(0)

上一页 1 2 3 4 5 6