Mathematically some problems look hard. But with the help of the computer, some

#include#include#include#includeusing namespace std;typedef unsigned long long u

Given a linked list and a value x, partition it such that all nodes less than x

題意給一個N*N的方陣，找出一個子矩陣，使子矩陣的和最大。(n<=100)思路一維的情況是經典的”最大連續和問題”。我們考慮把二維

 序列變換Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Ja

LeetCode Contains Duplicate III題目思路我的方法是先用一個結構體，存下每個數字的值和其原坐標；然後根據值大小排序；接著遍歷每一個數

題目描述(Permutation Sequence) The set [1,2,3,…,n] contains a total of n! uni

A. Two Substrings time limit per test 2 seconds memory limit per test 256 megaby

折線分割平面Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Ot

 Wooden SticksTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32

#pragma once#include #include #define _SIZE_ 100using namespace std;class Count{

#include using namespace std;int getmaxsum(int a[],int n){ int i = 0; int

 Moving TablesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32

 #include #include #include using namespace std;const int maxn=100000+5;int

  2648: SJY擺棋子 Time Limit: 20 Sec Memory Limit: 128 MB Submit: 1180 Solved:

 學習過簡單工廠模式，感覺很好用。在創建對象時，可以將復雜的初始化操作從客戶端分離出來，簡化客戶端代碼。大大的減少了代碼修改的難度。而且可以通過參數不

DNA repair Time Limit: 2000MS   Memory Limit: 65536K Total Su

題目描述 Given a binary tree, return the bottom-up level order traversal of its node

很有意思的貪心:  Let's reformulate the condition in terms of a certain he

DescriptionFJ is about to take his N (1 ≤ N ≤ 30,000) cows to the annual&q