![](https://img-blog.csdnimg.cn/20201014180756923.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode
文章平均质量分 77
xyx_Clack
希望能在这条路上越走越远。
展开
-
再从萌新开始-Leetcode每日题解-345. Reverse Vowels of a String
345. Reverse Vowels of a String(Easy)Write a function that takes a string as input and reverse only the vowels of a string.Example 1:Given s = "hello", return "holle".Example 2:Giv原创 2018-01-11 11:09:43 · 172 阅读 · 0 评论 -
再从萌新开始-Leetcode每日题解-287. Find the Duplicate Number
287. Find the Duplicate Number(Medium)Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume原创 2018-01-20 15:53:20 · 228 阅读 · 0 评论 -
再从萌新开始-Leetcode每日题解-667. Beautiful Arrangement II
667. Beautiful Arrangement II(Medium)Given two integers n and k, you need to construct a list which contains n different positive integers ranging from 1 to n and obeys the following requi原创 2018-01-10 10:16:31 · 169 阅读 · 0 评论 -
再从萌新开始-Leetcode每日题解-153. Find Minimum in Rotated Sorted Array
153. Find Minimum in Rotated Sorted Array(Medium)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原创 2018-01-09 10:49:07 · 153 阅读 · 0 评论 -
再从萌新开始-Leetcode每日题解-445. Add Two Numbers II
445. Add Two Numbers II(Medium)You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their nodes contain a single原创 2018-01-08 13:34:12 · 217 阅读 · 0 评论 -
再从萌新开始-Leetcode每日题解-447. Number of Boomerangs
447. Number of Boomerangs(easy)Example:Given n points in the plane that are all pairwise distinct, a "boomerang" is a tuple of points (i, j, k) such that the distance between iand j equa原创 2018-01-06 18:46:20 · 239 阅读 · 0 评论 -
再从萌新开始-Leetcode每日题解-160. Intersection of Two Linked Lists
160. Intersection of Two Linked Lists(easy)Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists:A:原创 2018-01-07 10:37:59 · 133 阅读 · 0 评论 -
再从萌新开始-Leetcode每日题解-315. Count of Smaller Numbers After Self
315. Count of Smaller Numbers After Self(hard)You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number o原创 2018-01-22 14:26:10 · 214 阅读 · 0 评论 -
再从萌新开始-Leetcode每日题解-740. Delete and Earn
740. Delete and EarnGiven an array nums of integers, you can perform operations on the array.In each operation, you pick any nums[i] and delete it to earn nums[i] points. After, you must原创 2018-01-12 10:34:34 · 301 阅读 · 1 评论