数组
tangyifei1991
这个作者很懒,什么都没留下…
展开
-
Median of Two Sorted Arrays 两个数组的中位数
class Solution {public: double find_kth(int A[],int m,int B[],int n, int k) { if(m>n) return find_kth(B,n,A,m,k); if(m==0) return B[k-1]; if(k==1) return min(A原创 2014-01-18 21:48:41 · 379 阅读 · 0 评论 -
Remove Element 删除元素
class Solution {public: int removeElement(int A[], int n, int elem) { int index=0; int length=0; for(int i=0;i { if(A[i]!=elem)原创 2014-01-19 11:28:02 · 595 阅读 · 0 评论 -
Valid Sudoku 有效的数独
class Solution {public: bool isValidSudoku(vector > &board) { bool used[9]; for(int i=0;i { fill(used,used+9,false); for(int j=0;j原创 2014-01-19 15:33:19 · 426 阅读 · 0 评论 -
Rotate Image 旋转图像
class Solution {public: void rotate(vector > &matrix) { int n=matrix.size(); for(int i=0;i { for(int j=0;j { swap(matrix[i][j原创 2014-01-19 15:44:09 · 345 阅读 · 0 评论 -
走台阶问题
class Solution {public: int climbStairs(int n) { int *num=new int[n]; num[0]=1; num[1]=2; for(int i=2;i { num[i]=num[i-1]+num[i-2]; } return num[n-1];原创 2014-01-19 15:49:10 · 437 阅读 · 0 评论 -
Remove Duplicates from Sorted Array 删除数组中的重复元素
class Solution {public: int removeDuplicates(int A[], int n) { // IMPORTANT: Please reset any member data you declared, as // the same Solution instance will be reused for eac原创 2014-01-18 21:13:10 · 463 阅读 · 0 评论 -
Search in Rotated Sorted Array II 旋转的数组中查找,有重复元素
class Solution {public: bool search(int A[], int n, int target) { // IMPORTANT: Please reset any member data you declared, as // the same Solution instance will be reused for原创 2014-01-18 21:43:11 · 440 阅读 · 0 评论 -
3Sum Closest 三数最接近
class Solution {public: int threeSumClosest(vector &num, int target) { int result=0; if(num.size()==3) return num[0]+num[1]+num[2]; int mincloset =INT_MAX; s原创 2014-01-19 11:13:33 · 429 阅读 · 0 评论 -
Trapping Rain Water 捕获最多的雨水
class Solution {public: int trap(int A[], int n) { int max=0; for(int i=0;i { if(A[i]>A[max]) max=i; } int water=0;原创 2014-01-19 15:40:25 · 439 阅读 · 0 评论 -
Gas Station 汽油站问题
class Solution {public: int canCompleteCircuit(vector &gas, vector &cost) { int startindex=0; int sum=0; int total=0; for(int i=0;i { s原创 2014-01-19 16:08:23 · 560 阅读 · 0 评论 -
4Sum 四数之和
class Solution {public: vector > fourSum(vector &num, int target) { vector> *v =new vector>();if(num.size()sort(num.begin(),num.end());set> temp;for(size_t i=0;i{for(size_原创 2014-01-19 11:24:30 · 378 阅读 · 0 评论 -
两个数之和等于目标数
class Solution {public: struct Node { int val; int index; Node(){}; Node(int x,int idx):val(x),index(idx){} }; static bool compare(Node l1,Node原创 2014-01-19 11:05:45 · 522 阅读 · 0 评论 -
Longest Consecutive Sequence 最长连续子序列
class Solution {public: int longestConsecutive(vector &num) { unordered_map used; for(auto n:num) used[n]=false; int longest=0; for(auto n:num)原创 2014-01-19 11:02:54 · 410 阅读 · 0 评论 -
3Sum 三个数之和
class Solution {public: vector > threeSum(vector &num) { vector>*v =new vector>(); if(num.size() { return *v; } sort(num.begin(),num.en原创 2014-01-19 11:10:49 · 483 阅读 · 0 评论 -
Permutation Sequence 排列序列-第K个排列
class Solution {public: string getPermutation(int n, int k) { vector num(n); int factorial=1; for(int i=0;i { num[i]=i+1; factorial原创 2014-01-19 15:30:52 · 490 阅读 · 0 评论 -
Single Number II 上一题的续
class Solution {public: int singleNumber(int A[], int n) { int result=0; int count[32]; for(int i=0;i { count[i]=0; }原创 2014-01-19 16:21:04 · 455 阅读 · 0 评论 -
Next Permutation 下一个排列
class Solution {public: void nextPermutation(vector &num) { int i=num.size()-2; while(i>=0&&num[i]>=num[i+1]) { i--; } if(i {原创 2014-01-19 15:25:07 · 378 阅读 · 0 评论 -
Plus One 加一
class Solution {public: vector plusOne(vector &digits) { int n=digits.size(); int i=0; for(;i { if(digits[i]!=9) break; }原创 2014-01-19 15:47:16 · 419 阅读 · 0 评论 -
Gray Code 格雷码编码
class Solution {public: vector grayCode(int n) { vector result; int num=1 for(int i=0;i { result.push_back(i^(i>>1)); } return r原创 2014-01-19 15:52:00 · 561 阅读 · 0 评论 -
Set Matrix Zeroes 将矩阵行列置为0
class Solution {public: void setZeroes(vector > &matrix) { int m=matrix.size(); int n=matrix[0].size(); bool row_has_zero=false; bool col_has_zero=false;原创 2014-01-19 16:05:08 · 522 阅读 · 0 评论 -
Candy 分糖果
class Solution {public: int candy(vector &ratings) { int num=ratings.size(); int *candy=new int[num]; for(int i=0;i { candy[i]=1; } for(int i=1;i { if(ra原创 2014-01-19 16:15:41 · 559 阅读 · 0 评论 -
Remove Duplicates from Sorted Array II 删除重复元素,重复元素最多允许出现两次
class Solution {public: int removeDuplicates(int A[], int n) { // IMPORTANT: Please reset any member data you declared, as // the same Solution instance will be reused for eac原创 2014-01-18 21:19:36 · 488 阅读 · 0 评论 -
Search in Rotated Sorted Array 在旋转的数组中查找元素
class Solution {public: int search(int A[], int n, int target) { // IMPORTANT: Please reset any member data you declared, as // the same Solution instance will be reused for e原创 2014-01-18 21:28:33 · 392 阅读 · 0 评论 -
Single Number 找出只出现一次的元素
class Solution {public: int singleNumber(int A[], int n) { int result= A[0]; for(int i=1;i { result=result^A[i]; } return原创 2014-01-19 16:17:59 · 388 阅读 · 0 评论