Integers

Largest Rectangle in Histogram

https://leetcode.com/problems/largest-rectangle-in-histogram/ Given n non-negative integers
·2015-11-02 12:55

Problem 1092

Problem Description Your task is to Calculate the sum of some integers.
·2015-11-02 12:54

zju Problem 1001: A + B Problem

Calculate a + b Input The input will consist of a series of pairs of integers a and b,separated by a
·2015-11-02 12:52

[LeetCode] Jump Game 数组控制

Given an array of non-negative integers, you are initially positioned at the first index of the array
·2015-11-02 11:48

POJ 3468 A Simple Problem with Integers

线段树的指针表示法。 代码还有待消化。。   代码里面多次用到了函数递归，感觉这次对递归又有了深一层的理解。 1 #define LOCAL 2 #include <iostream> 3 #include <cstdio> 4 #include <cstring> 5 using namespace std
·2015-11-02 11:35

UVa 10106 Product

 Product      The Problem The problem is to multiply two integers X, Y. (
·2015-11-02 11:20

LeetCode - Trapping Rain Water

Trapping Rain Water 2014.2.10 03:25 Given n non-negative integers representing an elevation
·2015-11-02 11:11

POJ1528（数论）

本题关键就是注意输出格式，从题意 Format counts: the echoed integers should be right justified within the first 5 spaces
·2015-11-02 11:10

Core Java Volume I — 3.5. Operators

The / operator denotes integer division if both arguments are integers
·2015-11-02 11:29

Think Python - Chapter 12 Tuples

The values can be any type, and they are indexed by integers, so in that respect tuples are a lot like
·2015-11-02 11:26

Think Python - Chapter 11 - Dictionaries

In a list, the indices have to be integers; in a dictionary they can be (almost) any type.You can think
·2015-11-02 11:25

LeetCode15:3Sum

Givenanarray S of n integers,arethereelements a, b, c in S suchthat a + b + c =0?
geekmanong·2015-11-02 11:00

Contains Duplicate III

Contains Duplicate III 问题：Given an array of integers, find out whether there are two distinct indices
·2015-11-02 10:31

【leetcode刷题笔记】4Sum

Given an array S of n integers, are there elements a, b, c, and 
·2015-11-02 10:28

【leetcode刷题笔记】Largest Rectangle in Histogram

Given n non-negative integers representing the histogram's bar height where the width of each
·2015-11-02 10:26

【leetcode刷题笔记】3Sum

Given an array S of n integers, are there elements a, b, c in
·2015-11-02 10:26

【leetcode】Search for a Range

Given a sorted array of integers, find the starting and ending position of a given target value.
·2015-11-02 10:22

Hash和枚举 解决POJ 1840

following form:  a1x1 3+ a2x2 3+ a3x3 3+ a4x4 3+ a5x5 3=0  The coefficients are given integers
·2015-11-02 10:41

线段树专辑—— pku 3468 A Simple Problem with Integers

http://poj.org/problem?id=3468 典型的一道基于lazy传递的线段树题目，这题和一般题目不同的地方在于，它的每次操作不是简单的覆盖线段，而是累加。记得第一次写的时候纠结了好久。 好的，既然是累加，那么如何传递lazy呢？答案是传递累加值！ 为线段树加一个add域，表示该线段需要加几。如果某区间的add不为0，那么就将该区间的add传递给其子区间，并且跟新子区间的s
·2015-11-02 09:12

[Project Euler]加入欧拉 Problem 14

The following iterative sequence is defined for the set of positive integers: n n/2 (n is even)n
·2015-11-02 09:43

线段树成段更新 poj 3468 A Simple Problem with Integers

 poj  3468  A Simple Problem with Integers 题目链接：http://poj.org/problem?
·2015-11-02 09:08

差分约束系统 ZQUOJ 23147&&POJ 1201 Intervals

Description You are given n closed, integer intervals [ai, bi] and n integers c1, ..., cn.
·2015-11-02 09:57

欧拉函数 POJ 2407 Relatives&&POJ 2478 Farey Sequence

;POJ 2407  Relatives   Description Given n, a positive integer, how many positive integers
·2015-11-02 09:53

poj2593

nbsp;65536K Total Submissions: 13533   Accepted: 5654 Description Give you N integers
·2015-11-02 09:58

poj2479

65536K Total Submissions: 27486   Accepted: 8410 Description Given a set of n integers
·2015-11-02 09:57

poj2479

65536K Total Submissions: 27256   Accepted: 8329 Description Given a set of n integers
·2015-11-02 09:55

[Leetcode] Largest Rectangle in Histogram

Given n non-negative integers representing the histogram's bar height where the width of each
·2015-11-02 09:23

[Leetcode] Trapping Rain Water

Given n non-negative integers representing an elevation map where the width of each bar is
·2015-11-02 09:22

【leetcode】Trapping Rain Water(hard)

Given n non-negative integers representing an elevation map where the width of each bar is
·2015-11-02 09:43

**LeetCode-Divide Two Integers

首先不看那些cornercase的话不管正负号思想就是每次给除数乘以二然后和被除数比较找到最大的一个比被除数小的倍数比如15/3那最大的可以从15里面减去的就是12是3的四倍乘以二通过左移一位来实现这样的话为了记录那个最大数字是除数的几倍同时用一个1来同时左移记录发现是四倍然后就从被除数中减去这个最大倍数然后一直循环到即使1倍也不能减去了就累计出来了得数但是首先要注意的是因为要左移可能会超过被除数
bsbcarter·2015-11-02 01:00

POJ 3468 A Simple Problem with Integers (线段树)

A Simple Problem with Integers Time Limit: 5000MS   Memory Limit: 131072K Total
·2015-11-01 16:43

POJ 3090 坐标系上的视线遮蔽问题

Description A lattice point (x, y) in the first quadrant (x and y are integers greater than or equal
·2015-11-01 14:36

[LeetCode] Count and Say 字符串

The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221,
·2015-11-01 14:04

[LeetCode] Search a 2D Matrix 二分搜索

This matrix has the following properties:   Integers in each row are sorted from left to right
·2015-11-01 14:59

[LeetCode] Trapping Rain Water 栈

Given n non-negative integers representing an elevation map where the width of each bar is
·2015-11-01 14:56

[LeetCode] 4Sum hash表

Given an array S of n integers, are there elements a, b, c, and 
·2015-11-01 14:53

[LeetCode] Single Number II 位运算

Given an array of integers, every element appears three times except for one.
·2015-11-01 14:52

[LeetCode] Jump Game II 贪心

 Given an array of non-negative integers, you are initially positioned at the first index of the
·2015-11-01 14:47

[Project Euler] Problem 14

The following iterative sequence is defined for the set of positive integers: n n/2 (n is even) n
·2015-11-01 13:32

Core Java Volume I — 3.10. Arrays

For example, if a is an array of integers, then
·2015-11-01 13:56

Basic Calculator II

The expression string contains only non-negative integers, +, -, *, / 
·2015-11-01 13:14

A Tour of Go : Exercise: Slices

should return a slice of length dy, each element of which is a slice of dx 8-bit unsigned integers
·2015-11-01 13:25

Twitter算法面试题详解（Java实现）——Trapping Rain Water

【算法题：求出高低不同的砖中能存多少水】 「Trapping Rain Water」 Given n non-negative integers representing an
·2015-11-01 13:51

分数拆分（ Fractions Again， UVA 10976）-ACM

see that for every fraction in the form  (k > 0), we can always find two positive integers
·2015-11-01 12:55

POJ 3468.A Simple Problem with Integers 解题报告

用树状数组和线段树会比较简单，这里用这道题来学习Splay。 第一次写，代码比较丑 /* 初始化添加一个key值足够大的结点 保证每个需要的结点都有后继 */ #include <iostream> #include <cstdio> #define ll long long using namespace std;
·2015-11-01 12:49

Solution 30: 从1到n出现“1”的次数

问题描述 Given an integer n, count the total number of digit 1 appearing in all non-negative integers
·2015-11-01 12:44

HDOJ1018结题报告--------Big Number

Problem Description In many applications very large integers numbers are required.
·2015-11-01 12:02

[LeetCode 题解]: Two Sum

系列传送门：  http://www.cnblogs.com/double-win/category/573499.html   1.题目描述 Given an array of integers
·2015-11-01 11:56

[LeetCode] Search for a Range 二分搜索

Given a sorted array of integers, find the starting and ending position of a given target value.
·2015-11-01 10:00

POJ 3468 (线段树 区间增减) A Simple Problem with Integers

这题WA了好久，一直以为是lld和I64d的问题，后来发现是自己的pushdown函数写错了，说到底还是因为自己对线段树理解得不好。 因为是懒惰标记，所以只有在区间分开的时候才会将标记往下传递。更新和查询都要pushdown。 1 #include <cstdio> 2 3 typedef long long LL; 4 5 const int max
·2015-11-01 10:03
上一页 35 36 37 38 39 40 41 42 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他