## 树状数组求逆序对

cArr=

LeetCode是用C# release模式运行的。

using System;
using System.Collections.Ge[......]继续阅读

## 题目

Given n balloons, indexed from 0 to n-1. Each balloon is painted with a
number on it[……]

# 推导

1-2-3-4
|___|


Reduce[Mod[n – 1, 3] == Mod[2n – 1, 3], n, In[……]

## Fraction to Recurring Decimal正则表达式、循环小数复习

Given two integers representing the numerator and denominator of a fraction, ret[……]

# 题目

Given an array of size n, find the majority element. The m[……]

# 题目

Given an unsorted array, find the maximum difference between the successive elements in its sort[……]