sql---临时表

建立临时表并插入数据select sector_id, phycellid as pci into temp from tbcell where sector_id in ( select distinct tbcell.sector_id ...

2016-04-26 10:59:04

阅读数:238

评论数:0

SQL---用一张表中的一列更新另一张表中的一列

test_step2all_38400:tbcell38400:用tbcell38400中的pci替换掉test_step2all_38400中的phycellid update test_step2all_38400 set test_step2all_38400.phycellid = tbc...

2016-04-26 10:10:30

阅读数:1032

评论数:0

KMP

输入 第一行一个整数N,表示测试数据组数。接下来的N*2行,每两行表示一个测试数据。在每一个测试数据中,第一行为模式串,由不超过10^4个大写字母组成,第二行为原串,由不超过10^6个大写字母组成。其中N<=20输出 对于每一个测试数据,按照它们在输入中出现的顺序输出一行Ans,表示模式...

2016-04-22 16:27:34

阅读数:203

评论数:0

最短作业优先---SJF

#include "iostream" #include "algorithm" #include "math.h" #define max(a, b) a > b ? a : b;using namespace std;struc...

2016-04-22 13:43:08

阅读数:1006

评论数:0

leetcode---Best Time to Buy and Sell Stock

Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction...

2016-04-16 12:54:07

阅读数:186

评论数:0

c#---读文件

weight = new int[N, N]; //加权矩阵 string[] lines = System.IO.File.ReadAllLines(@"F:\1.txt"); int i = 0; char c = ' '; foreach (string line...

2016-04-14 20:09:44

阅读数:214

评论数:0

后续遍历---树、深搜

时间限制:10000ms 单点时限:1000ms 内存限制:256MB给出一棵二叉树的前序和中序遍历的结果,还原这棵二叉树并输出其后序遍历的结果。提示:分而治之——化大为小,化小为无 输入每个测试点(输入文件)有且仅有一组测试数据。每组测试数据的第一行为一个由大写英文字母组成的字符串,表示该...

2016-04-10 11:58:53

阅读数:281

评论数:0

leetcode---Factorial Trailing Zeroes

Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.class Solution { public: ...

2016-04-09 23:21:52

阅读数:183

评论数:0

leetcode---Majority Element

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the...

2016-04-09 23:05:39

阅读数:188

评论数:0

leetcode---Excel Sheet Column Title

Given a positive integer, return its corresponding column title as appear in an Excel sheet.For example:1 -> A 2 -> B 3 -> C ... 26 -> Z ...

2016-04-09 22:45:51

阅读数:182

评论数:0

leetcode---Valid Palindrome

Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example, “A man, a plan, a canal: P...

2016-04-09 21:58:49

阅读数:177

评论数:0

leetcode---Pascal's Triangle II

Given an index k, return the kth row of the Pascal’s triangle.For example, given k = 3, Return [1,3,3,1].class Solution { public: vector<int&...

2016-04-09 21:50:10

阅读数:177

评论数:0

leetcode---Pascal's Triangle

Given numRows, generate the first numRows of Pascal’s triangle.For example, given numRows = 5, Return[ [1], [1,1], [1,2,1], [1,3,3...

2016-04-09 21:46:27

阅读数:207

评论数:0

leetcode---Path Sum

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.F...

2016-04-09 19:48:21

阅读数:156

评论数:0

leetcode---Minimum Depth of Binary Tree

Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest l...

2016-04-09 18:58:48

阅读数:152

评论数:0

leetcode---Balanced Binary Tree

Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the dept...

2016-04-09 18:27:00

阅读数:456

评论数:0

leetcode---Binary Tree Level Order Traversal II

Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root).For ...

2016-04-09 18:15:37

阅读数:151

评论数:0

leetcode---Maximum Depth of Binary Tree

Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest l...

2016-04-09 18:09:20

阅读数:182

评论数:0

leetcode---Binary Tree Level Order Traversal

Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).For example: Given binary tree ...

2016-04-09 17:47:26

阅读数:153

评论数:0

leetcode--- Symmetric Tree---平衡二叉树

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric:1 / \ 2 ...

2016-04-09 16:35:54

阅读数:151

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭