hashmap&bit manipulation
hebastast
这个作者很懒,什么都没留下…
展开
-
187. Repeated DNA Sequences
class Solution {public: vector<string> findRepeatedDnaSequences(string s) { unordered_map<int,int> m;//先讲string 映射成int 再进行hash 否则超内存 int hashindex=0; int len=10; in原创 2016-10-10 14:43:21 · 269 阅读 · 0 评论 -
423. Reconstruct Original Digits from English
public class Solution { public String originalDigits(String s) { int[] count = new int[10]; for (int i = 0; i < s.length(); i++){ char c = s.charAt(i); if (c原创 2017-02-13 10:20:12 · 306 阅读 · 0 评论 -
421. Maximum XOR of Two Numbers in an Array
class Solution {public: int findMaximumXOR(vector<int>& nums) { int max=0; int mask=0; unordered_set<int> s; for(int i=31;i>=0;i--) { s.clear();原创 2017-02-12 12:08:35 · 295 阅读 · 0 评论 -
391. Perfect Rectangle
class Solution {public: bool isRectangleCover(vector<vector<int>>& rectangles) { unordered_set<string> s; int x1=INT_MAX; int y1=INT_MAX; int x2=INT_MIN; in原创 2017-01-10 13:56:10 · 349 阅读 · 0 评论 -
389. Find the Difference
class Solution {public: char findTheDifference(string s, string t) { map<char,int> tm; map<char,int> sm; for(int i=0;i<t.size();i++) tm[t[i]]++; for(int原创 2017-01-08 23:05:28 · 267 阅读 · 0 评论 -
367. Valid Perfect Square
class Solution {public: bool isPerfectSquare(int num) { int i=1; while(num>0) { num-=i; i+=2; } return num==0; }};原创 2016-12-20 10:10:01 · 331 阅读 · 0 评论 -
355. Design Twitter
public class Twitter { private Map<Integer,user> usermap; private static int timestamp=0; class twitte{ int id; int time; twitte next; twitte(int id){原创 2016-12-13 15:15:21 · 392 阅读 · 0 评论 -
347. Top K Frequent Elements
class Solution { class ComGreater { public: bool operator()(const pair<int, int> &item1, const pair<int, int> &item2) { return item1.second > item2.second; } };public:原创 2016-11-23 15:17:39 · 283 阅读 · 0 评论 -
219. Contains Duplicate II
class Solution {public: bool containsNearbyDuplicate(vector<int>& nums, int k) { unordered_set<int> s; if(k<0) return false; if(k>=nums.size()) k=nu原创 2016-10-20 10:51:42 · 285 阅读 · 0 评论 -
217. Contains Duplicate
class Solution {public: bool containsDuplicate(vector<int>& nums) { map<int,int>m; for(int i=0;i<nums.size();i++) { m[nums[i]]++; } for(auto it=原创 2016-10-20 10:11:15 · 281 阅读 · 0 评论 -
260. Single Number III
class Solution {public: vector<int> singleNumber(vector<int>& nums) { unordered_map<int,int> m; for(int i=0;i<nums.size();i++) { m[nums[i]]++; }原创 2016-10-24 11:56:44 · 245 阅读 · 0 评论 -
191. Number of 1 Bits
class Solution {public: int hammingWeight(uint32_t n) { int count=0; for(int i=0;i<32;i++) { if(n&1) count++; n>>=1; }原创 2016-10-12 15:55:42 · 249 阅读 · 0 评论 -
190. Reverse Bits
class Solution {public: uint32_t reverseBits(uint32_t n) { uint32_t m; for(int i=0;i<32;i++) { m<<=1; m|=(n&1); n>>=1; }原创 2016-10-11 11:23:45 · 256 阅读 · 0 评论 -
03. Frog Jump
public class Solution { public boolean canCross(int[] stones) { HashMap<Integer,HashSet<Integer>> map=new HashMap<>(); map.put(stones[0], new HashSet<Integer>()); map.get(st原创 2017-02-01 15:22:25 · 244 阅读 · 0 评论