Array
文章平均质量分 59
patkritLee
practice makes perfect.
展开
-
leetcode 238 Product of Array Except Self
Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Solve it without division and in O原创 2016-02-23 11:59:44 · 352 阅读 · 0 评论 -
152. Maximum Product Subarray
题意:Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,3,-2,4],the contiguous subarray [2,3] has the large原创 2016-02-23 16:20:58 · 326 阅读 · 0 评论 -
大数相乘
题意:给定两个大数,求相乘结果题解:利用数组来存中间结果以及结果。void mulInteger_2(string &str1, string &str2) //两个整数相乘{ int num1[200] = {0}; int num2[200] = {0}; int result[300] = {0}; //auto_ptr output(new string (str2)原创 2016-02-24 20:37:57 · 438 阅读 · 0 评论 -
求出现次数大于数组长度一半的那个数
方法一:排序,找出最中间的那个数,就是,算法时间复杂度,o(nlogn)方法二:用临时变量,一个存放当前的数,一个用来计数// 求一串数中最多的数.cpp : 定义控制台应用程序的入口点。//#include "stdafx.h"#include#include using namespace std;int findOverhalf(vector& vec){ int原创 2016-02-24 21:33:52 · 482 阅读 · 0 评论 -
二分查找递归和非递归
//二分查找递归int BinarySearch(int* array,int left,int right, int k){int mid;if (left mid = (right - left) / 2;if (array[mid] == k)return mid;else if (array[mid]>k){return BinarySearch(array原创 2016-08-20 11:27:34 · 385 阅读 · 0 评论 -
两个有序单链表的合并&两个有序数组的合并
1.两个有序单链表的合并typedef struct ListNode{ int val; ListNode* next;}ListNode;ListNode* mergeList(ListNode* pHead1,ListNode* pHead2){ if (pHead1==NULL) return pHead2; if (pHead2 == NULL) return pHea原创 2016-08-09 08:29:20 · 1153 阅读 · 0 评论 -
数组中的逆序对
利用归并排序的原理,先计算内部的逆序对,然后每次合并的时候,计算新的组合逆序对int InversePairs(int* data,int length){ if (data == NULL || length < 2) return 0; int* copy = new int[length]; for (int i = 0; i < length; i++){ copy[i] =原创 2016-08-11 13:34:21 · 367 阅读 · 0 评论