数组
hebastast
这个作者很懒,什么都没留下…
展开
-
258. Add Digits
class Solution {private: int addhelper(int num) { int sum=0; while(num) { sum+=(num%10); num/=10; } return sum; }public:原创 2016-10-24 11:16:55 · 254 阅读 · 0 评论 -
137. Single Number II
class Solution {public: int singleNumber(vector<int>& nums) { map<int ,int > count; for(int i=0;i<nums.size();i++) { count[nums[i]]++; } for(auto it=count.begin()原创 2016-10-04 16:06:17 · 319 阅读 · 0 评论 -
155. Min Stack
class MinStack {private: long min; stack<long> *lstack;public: /** initialize your data structure here. */ MinStack() { lstack=new stack<long>(); } void push(int x) {原创 2016-10-04 17:09:29 · 262 阅读 · 0 评论 -
290. Word Pattern
**class Solution {public: bool wordPattern(string pattern, string str) { int pindex=0; int start=0; int end=0; int psize=pattern.size(); int ssize=str.size(原创 2016-11-15 10:12:52 · 299 阅读 · 0 评论 -
295. Find Median from Data Stream
class MedianFinder {private: vector<int> v;public: // Adds a number into the data structure. void addNum(int num) { v.push_back(num); int n=v.size(); if(n>=2)原创 2016-11-15 11:11:38 · 224 阅读 · 0 评论 -
303. Range Sum Query - Immutable
class NumArray {private: vector<int> number;public: NumArray(vector<int> &nums) { for(int i=1;i<nums.size();i++) { nums[i]+=nums[i-1]; } number=nums;原创 2016-11-18 14:52:12 · 289 阅读 · 0 评论 -
304. Range Sum Query 2D - Immutabl
class NumMatrix {private: vector<vector<int>> m;public: NumMatrix(vector<vector<int>> &matrix) { m=matrix; for(int i=0;i<m.size();i++) { for(int j=1;j<m[0]原创 2016-11-19 15:05:53 · 398 阅读 · 0 评论 -
313. Super Ugly Number
class Solution {private: struct A{ int a; int b; }; class compareA{ public:bool operator()(A item1,A item2) { return item1.a<item2.a; }原创 2016-11-25 14:28:27 · 294 阅读 · 0 评论 -
334. Increasing Triplet Subsequence
class Solution {public: bool increasingTriplet(vector<int>& nums) { int c1=INT_MAX; int c2=INT_MAX; for(int n:nums) { if(n<=c1) c1=n;原创 2016-12-08 10:26:14 · 214 阅读 · 0 评论 -
136. Single Number
class Solution {public: int singleNumber(vector<int>& nums) { map<int,int > count; for(int i=0;i<nums.size();i++) { count[nums[i]]++; } for(auto原创 2016-10-04 15:58:52 · 247 阅读 · 0 评论 -
135. Candy
class Solution {public: int candy(vector<int>& ratings) { int rsize=ratings.size(); if(rsize<=1) return rsize; vector<int> num(rsize,1); for(int i=0;i<n原创 2016-10-04 15:49:51 · 352 阅读 · 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 · 236 阅读 · 0 评论 -
263. Ugly Number
class Solution {public: bool isUgly(int num) { for(int i=2;i<6&#i++) { while(num%i==0) num/=i; } return num==1; }};原创 2016-10-25 12:54:07 · 238 阅读 · 0 评论 -
264. Ugly Number II
class Solution {public: int nthUglyNumber(int n) { if(n<=0) return false; if(n==1) return 1; int t2,t3,t5; t2=t3=t5=0; vector<int> n原创 2016-10-25 14:21:49 · 238 阅读 · 0 评论 -
268. Missing Number
class Solution {public: int missingNumber(vector<int>& nums) { vector<bool> flag(nums.size()+1,false); for(int i=0;i<nums.size();i++) { flag[nums[i]]=true;原创 2016-10-26 09:35:23 · 228 阅读 · 0 评论 -
274. H-Index
class Solution {public: int hIndex(vector<int>& citations) { vector<int> count(citations.size()+1,0); int l=citations.size(); if(l==0) return 0; for(int原创 2016-10-26 10:36:38 · 294 阅读 · 0 评论 -
209. Minimum Size Subarray Sum
class Solution {public: int minSubArrayLen(int s, vector<int>& nums) { int left=0; int right=0; int sum=0; int min_dis=INT_MAX; int n=nums.size(); w原创 2016-10-16 14:51:35 · 259 阅读 · 0 评论 -
149. Max Points on a Line
/** * Definition for a point. * struct Point { * int x; * int y; * Point() : x(0), y(0) {} * Point(int a, int b) : x(a), y(b) {} * }; */class Solution {public: int maxPoin原创 2016-10-03 10:25:38 · 241 阅读 · 0 评论 -
134. Gas Station
class Solution {public: int canCompleteCircuit(vector<int>& gas, vector<int>& cost) { int start=gas.size()-1; int end=0; int sum=gas[start]-cost[start]; while(start原创 2016-10-04 10:56:56 · 257 阅读 · 0 评论 -
343. Integer Break
class Solution {public: int integerBreak(int n) { if(n==2) return 1; if(n==3) return 2; int product=1; while(n>4) { prod原创 2016-12-09 10:36:19 · 227 阅读 · 0 评论 -
342. Power of Four
class Solution {public: bool isPowerOfFour(int num) { float a=log(num)/log(4); if(a-int(a)==0) return true; else return false; }};原创 2016-12-09 10:40:21 · 228 阅读 · 0 评论 -
318. Maximum Product of Word Lengths
class Solution {public: int maxProduct(vector<string>& words) { if(words.size()==0) return 0; int len=words.size(); vector<int> wordschar(len,0); for(in原创 2016-11-27 20:43:44 · 227 阅读 · 0 评论 -
390. Elimination Game
class Solution {public: int lastRemaining(int n) { int head=1; int remain=n; int setp=1; bool forward=true; while(remain>1) { if(forward原创 2017-01-09 11:00:04 · 310 阅读 · 0 评论 -
Integer Replacement
public class Solution { public int integerReplacement(int n) { int c = 0; while (n != 1) { if ((n & 1) == 0) { n >>>= 1; } else if (n == 3 || Integer.bitCount(n +原创 2017-01-13 20:24:41 · 316 阅读 · 0 评论 -
398. Random Pick Index
public class Solution { private int[] nums; private Random random; public Solution(int[] nums) { this.nums=nums; random=new Random(); } public int pick(int target) {原创 2017-01-14 12:23:15 · 265 阅读 · 0 评论 -
392. Is Subsequence
class Solution {public: bool isSubsequence(string s, string t) { auto it=s.begin(); for(char c:t) { it+=((*it)==c); } return it==s.end(); }原创 2017-01-11 12:52:25 · 290 阅读 · 0 评论 -
414. Third Maximum Number
public class Solution { public int thirdMax(int[] nums) { Integer max1=null; Integer max2=null; Integer max3=null; for(Integer num:nums) { if(num原创 2017-02-07 14:35:44 · 334 阅读 · 0 评论 -
406. Queue Reconstruction by Height
public class Solution { public int[][] reconstructQueue(int[][] people) { Arrays.sort(people,new Comparator<int[]>(){ public int compare(int[] a1,int[] a2){ retu原创 2017-01-17 15:39:27 · 255 阅读 · 0 评论 -
396. Rotate Function
class Solution {public: int maxRotateFunction(vector<int>& A) { int F=0; int sum=0; for(int i=0;i<A.size();i++) { sum+=A[i]; F+=i*A[i];原创 2017-01-13 10:47:16 · 226 阅读 · 0 评论 -
419. Battleships in a Board
public class Solution { public int countBattleships(char[][] board) { int m=board.length; if(m==0) return 0; int n=board[0].length; if(n==0)原创 2017-02-10 16:01:43 · 328 阅读 · 0 评论 -
371. Sum of Two Integers
class Solution {public: int getSum(int a, int b) { if(a==0) return b; if(b==0) return a; while(b!=0) { int carry=a&b;原创 2016-12-21 10:12:14 · 235 阅读 · 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 · 317 阅读 · 0 评论 -
357. Count Numbers with Unique Digits
class Solution {public: int countNumbersWithUniqueDigits(int n) { if(n==0) return 1; int ret=10; int unique=9; int available=9; while(n>1&&available原创 2016-12-15 10:26:20 · 298 阅读 · 0 评论 -
372. Super Pow
class Solution {private: int base=1337; int mypow(int a,int k) { a%=base; int ret=1; for(int i=0;i<k;i++) { ret=(ret*a)%base; }原创 2016-12-21 15:23:10 · 399 阅读 · 0 评论 -
365. Water and Jug Problem
public class Solution { public boolean canMeasureWater(int x, int y, int z) { if(x+y<z) return false; if(x==z||x==z||x+y==z) return true; if(x<y)原创 2016-12-19 14:20:44 · 304 阅读 · 0 评论 -
384. Shuffle an Array
public class Solution { private int[] nums; private Random r; public Solution(int[] nums) { this.nums=nums; r=new Random(); } /** Resets the array to its original con原创 2017-01-04 10:55:34 · 359 阅读 · 0 评论 -
380. Insert Delete GetRandom O(1)
public class RandomizedSet { private HashMap<Integer,Integer> m; private ArrayList<Integer> a; private Random r; /** Initialize your data structure here. */ public RandomizedSet() {原创 2017-01-05 10:41:51 · 333 阅读 · 0 评论 -
382. Linked List Random Node
class Solution {private: ListNode *head;public: /** @param head The linked list's head. Note that the head is guaranteed to be not null, so it contains at least one node. */ Soluti原创 2016-12-28 15:39:46 · 298 阅读 · 0 评论 -
381. Insert Delete GetRandom O(1) - Duplicates allowed
public class RandomizedCollection { private List<Integer> nums; private Map<Integer,Set<Integer>> indexs; private Random r; /** Initialize your data structure here. */ public Random原创 2017-01-05 16:14:55 · 274 阅读 · 0 评论 -
385. Mini Parser
package leetcode;import java.util.*;public class Solution { public NestedInteger deserialize(String s) { if(s.isEmpty()) return null; if(s.charAt(0)!='[') return new Neste原创 2017-01-07 11:46:40 · 422 阅读 · 0 评论