# [置顶] 一起来学OpenMP（1）——初体验

OpenMP是一种面向共享内存以及分布式共享内存的多处理器多线程并行编程语言。 我的开发环境是Windows、VS2008、双核处理器。   1. 在VS2008程序目录下找到vcomp90d.dll文件，并复制到windows/system32/目录下。 2. 创建一个名为OpenMP的空控制台工程（即没有VS2008不会生成任何文件） 3. 添加一个名为OpenMP.cpp的源文件...

# Dedecms生成sitemap.xml的简单方法

0. 为了便于理解，我们对www.shipinFM.com视频FM网站进行分析 1. 在后台核心->频道模型->单页文档管理中，增加一个页面，我们可以称之为XML网站地图，内容如下图所示，点击保存。 2. {style}目录下（默认是templets/default/目录），创建一个baidu_sitemap.htm文件，内容如下： {dede:php} echo ''. "\r\n"; ec...

# ROS历史

ROS是拥有许多先驱和贡献者的大项目，开发的协作框架的需求是机器人研究社区的许多人探索出来的，并且有许多的项目的创建也在朝着这个目标前进。 在2000年中期，各方的努力，包括 Various efforts at Stanford University in the mid-2000s involving integrative, embodied AI, such as the ST...

# LeetCode - Search for a Range

Given a sorted array of integers, find the starting and ending position of a given target value. Your algorithm's runtime complexity must be in the order of O(log n). If the target is not found ...

# LeetCode - Gray Code

The gray code is a binary numeral system where two successive values differ in only one bit. Given a non-negative integer n representing the total number of bits in the code, print the sequence of ...

# LeetCode - Remove Element

Given an array and a value, remove all instances of that value in place and return the new length. The order of elements can be changed. It doesn't matter what you leave beyond the new length. int...

# LeetCode - String to Integer (atoi)

Implement atoi to convert a string to an integer. Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input ...

# LeetCode - Length of Last Word

Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string. If the last word does not exist, return 0. Note: A word is...

# LeetCode - Rotate Image

You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Follow up: Could you do this in-place? void rotate(vector > &matrix) { // Start typi...

# 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 example: Given binary tree {3,9,20,#,#,15,7}...

# 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 leaf node. int depth(TreeNode* root, int leve...

# LeetCode - Sum Root to Leaf Numbers

Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1->2->3 which represents the number 123. Find the to...

# 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 (ie, buy one and sell one share of the stock...

# 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 {3,9,20,#,#,15,7}, 3 / \ 9 20 ...

# 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 2 / \ / \ 3 4 4 3 But the f...

476条 共24页1 2 3 4 5 ... 下一页 尾页
个人资料
• 访问：601456次
• 积分：11911
• 等级：
• 排名：第1394名
• 原创：413篇
• 转载：4篇
• 译文：59篇
• 评论：113条
文章分类
最新评论