Leetcode
文章平均质量分 59
小威威__
这个作者很懒,什么都没留下…
展开
-
Leetcode: 贪心算法
Leetcode 455Leetcode 135Leetcode 435Leetcode 605Leetcode 452Leetcode 763Leetcode 122Leetcode 406Leetcode 455 Assign Cookies (Easy)Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at mos原创 2021-01-09 13:08:34 · 740 阅读 · 0 评论 -
Leetcode: 73. Set Matrix Zeroes(Week15, Medium)
Leetcode 73 Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.题意:将矩阵中元素为0的对应行、列全部置0.思路:遍历整个矩阵,用两个set容器存储0元素的行与列,然后扫描完后,再执行置0操作。其中,对置换行,可以赋值长为n且全为0的vector数原创 2017-12-17 22:25:44 · 372 阅读 · 0 评论 -
Leetcode: 216. Combination Sum III(Week14, Medium)
Leetcode 216 Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers. Examp原创 2017-12-11 08:54:54 · 310 阅读 · 0 评论 -
Leetcode: 40. Combination Sum II(Week13, Medium)
Leetcode 40 Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. Each number in C may only be used once原创 2017-12-11 08:48:20 · 355 阅读 · 0 评论 -
Leetcode: 39. Combination Sum(Week12, Medium)
Leetcode39: Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. The same repeated number原创 2017-12-11 08:39:01 · 267 阅读 · 0 评论 -
Leetcode: 43.Multiply Strings(Week11, Medium)
注:本题使用的是高精度乘法的思路 Leetcode 43 Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2. Note: (1)The length of both num1 and num2 is < 110.原创 2017-11-19 09:08:46 · 300 阅读 · 0 评论 -
Leetcode: 16. 3Sum Closest(Week5, Medium)
学号: 15331204 方向: 数媒 姓名: 林威宏对称密码有五个组成部分: (1) 明文(M)(2) 密文(C)(3) 密钥(K)(4) 加密算法(E)(5) 解密算法(D)接下来的内容皆参照以上的符号定义。1. 算法原理概述DES,即Data Encryption Standard(1) 是一种对称加密算法,典型的DES以64位为分组对数据进行加密,且加密与解密用的是同一原创 2017-10-05 16:26:56 · 364 阅读 · 0 评论 -
Leetcode: 133. Clone Graph(Week6, Medium)
注:本题使用BFS算法 Leetcode 133 Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors. OJ’s undirected graph serialization: Nodes are labeled uniquely.原创 2017-10-15 14:01:38 · 308 阅读 · 0 评论 -
Leetcode: 130. Surrounded Region(Week7, Medium)
注: 本题使用BFS算法求解 Leetcode 130 Given a 2D board containing ‘X’ and ‘O’ (the letter O), capture all regions surrounded by ‘X’. A region is captured by flipping all ‘O’s into ‘X’s in that surround原创 2017-10-21 12:13:49 · 350 阅读 · 0 评论 -
Leetcode: 322. Coin Change(Week8, Medium)
注:本题是需要装满的完全背包问题 Leetcode 322 You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up tha原创 2017-10-29 21:17:41 · 350 阅读 · 0 评论 -
Leetcode: 34. Search for range(Week9, Medium)
注:本题采用二分法的思想 Leetcode 34 Given an array of integers sorted in ascending order, find the starting and ending position of a given target value. Your algorithm’s runtime complexity must be in th原创 2017-11-05 17:04:49 · 296 阅读 · 0 评论 -
Leetcode: 515.Find Largest Value in Each Tree Row(Week10, Medium)
注:本题采用的是BFS算法 Leetcode 515 You need to find the largest value in each row of a binary tree. Example: Input: 1 / \ 3 2 / \ \ 5 3 9 Output: [1, 3, 9]题意:找到二原创 2017-11-09 16:15:35 · 291 阅读 · 0 评论 -
Leetcode: 48.Rotate Image(Week4, Medium)
本题采用了两种解法:常规解法与特殊解法 Leetcode 48 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原创 2017-10-01 16:18:32 · 255 阅读 · 0 评论 -
Leetcode: 70. Climbing Stairs(Week1, Easy)
注: 本文使用三种方法实现Fibonacci Sequence:递归法、非递归法、矩阵快速幂法 Leetcode 70 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 distinc原创 2017-09-08 15:17:33 · 685 阅读 · 1 评论 -
Leetcode:93. Restore IP Addresses(Week1, Medium)
注:本题使用了分治的思想。 解题方法:递归法、暴力求解法 Leetcode 93 Given a string containing only digits, restore it by returning all possible valid IP address combinations. For example: Given “25525511135”,原创 2017-09-10 12:28:48 · 598 阅读 · 0 评论 -
Leetcode: 15. 3Sum(Week3,Medium)
注:本题算法无需实现去重操作。 Leetcode 15 Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero. Note: T原创 2017-09-24 17:48:21 · 353 阅读 · 0 评论 -
Leetcode: 13. Roman to Integer(Week2, Easy)
注:本题总结了罗马数字的表示规律并设计算法实现罗马数字与阿拉伯数字的转换 Leetcode 13 Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999.题意:给出一个罗马数字,请你编写一个程序将之转化为整数思路:罗马数字原创 2017-09-14 23:38:56 · 301 阅读 · 0 评论