LeetCode
李不予
这个作者很懒,什么都没留下…
展开
-
LeetCode 目录
题号 题目 备注 1 Two Sum Easy 7 Reverse Integer Easy 15 3Sum Medium 48 Rotate Image Medium 136 Single Number Easy 342 Power of Four Easy 595 Big Co...原创 2018-11-15 13:12:14 · 146 阅读 · 0 评论 -
LeetCode 765. Couples Holding Hands
class Solution { public int minSwapsCouples(int[] row) { int ans=0; for(int i=0;i<row.length;i+=2){ int second=(row[i]%2==0?row[i]+1:row[i]-1);//first,second ...原创 2019-04-12 14:57:02 · 91 阅读 · 0 评论 -
LeetCode 41. First Missing Positive
Given an unsorted integer array, find the smallest missing positive integer.原创 2019-04-12 14:30:07 · 74 阅读 · 0 评论 -
LeetCode 7. Reverse Integer
class Solution {public: int reverse(int x) { string s=to_string(x); if(s[0]=='-') std::reverse(s.begin()+1,s.end()); else std::reverse(s.begin(),s....原创 2019-04-02 17:10:13 · 115 阅读 · 0 评论 -
LeetCode 1. Two Sum
class Solution {public: vector<int> twoSum(vector<int>& nums, int target) { vector<int> res(2); for(int i=0;i<nums.size();i++){ for(int j=i+1;...原创 2019-04-02 16:29:40 · 691 阅读 · 0 评论 -
LeetCode 48. Rotate Image
class Solution {public: void rotate(vector<vector<int>>& matrix) { for(int i=0;i<matrix.size();i++) for(int j=i;j<matrix[i].size();j++) s...原创 2019-04-04 17:22:59 · 107 阅读 · 0 评论 -
LeetCode 15. 3Sum
class Solution {public: vector<vector<int>> threeSum(vector<int>& nums) { vector<vector<int>> res; int len=nums.size(); sort(nums.begin()...原创 2019-04-04 16:52:11 · 92 阅读 · 0 评论 -
LeetCode 905. Sort Array By Parity
class Solution {public: vector<int> sortArrayByParity(vector<int>& A) { vector<int> a(A.size()); int start=0,end=A.size()-1; for(int i=0;i<A.size(...原创 2019-03-23 18:37:52 · 92 阅读 · 0 评论 -
LeetCode 977. Squares of a Sorted Array
class Solution {public: vector<int> sortedSquares(vector<int>& A) { for(int i=0;i<A.size();i++) A[i]=A[i]*A[i]; sort(A.begin(),A.end()); ret...原创 2019-03-23 17:04:52 · 182 阅读 · 0 评论 -
LeetCode 595. Big Countries
select name,population,area from World where area>3000000 or population>25000000原创 2019-03-23 17:00:47 · 159 阅读 · 0 评论 -
LeetCode 709. To Lower Case
class Solution {public: string toLowerCase(string str) { for(int i=0;i<str.length();i++) if(str[i]>='A'&&str[i]<='Z') str[i]=str[i]-'A'+'a'; ...原创 2019-03-23 16:51:43 · 149 阅读 · 0 评论 -
LeetCode 136. Single Number
class Solution {public: int singleNumber(vector<int>& nums) { int res=0; for(int i=0;i<nums.size();i++) res^=nums[i]; return res; }};原创 2019-03-23 16:44:31 · 82 阅读 · 0 评论 -
LeetCode 771. Jewels and Stones
class Solution {public: int numJewelsInStones(string J, string S) { int exist[128]={0}; int num=0; for(int i=0;i<J.length();i++) exist[J[i]]=1; for(...原创 2019-03-23 16:40:05 · 178 阅读 · 0 评论 -
LeetCode 342. Power of Four
4的倍数...原创 2019-07-22 09:54:46 · 94 阅读 · 0 评论