C/C++
文章平均质量分 53
小-立子
菜鸟开始学编程
展开
-
N个数进栈的出栈顺序全排列及排列种数
//Made by Xu Lizi//2013/10/24#include #include #include #include using namespace std;int a[1000];long long num = 0;bool test_stack (int n);void print(int l, int r,原创 2013-10-24 00:55:22 · 3735 阅读 · 2 评论 -
Direct3D 11 学习笔记(二)
Direct3D 11 学习笔记(二)DXUT DXUT 能够提供一个简单的接口来处理 window 的创建,D3D device 的创建。 在不使用 DXUT 框架的时候,我们需要自己调用 windows 的 API 来创建窗口: // Register class WNDCLASSEX wcex; wcex.cbSize = sizeof( WND原创 2018-01-22 16:13:23 · 747 阅读 · 0 评论 -
LeetCode #6 ZigZag Conversion
Description The string “PAYPALISHIRING” is written in a zigzag pattern on a given number of rows like this:原创 2017-03-12 20:12:33 · 314 阅读 · 0 评论 -
LeetCode #5 Longest Palindromic Substring
Description Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.ExampleInput: “babad”原创 2017-03-12 19:57:50 · 244 阅读 · 0 评论 -
LeetCode #4 Median of Two Sorted Arrays
Description There are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).Examplenums1 = [1, 3原创 2017-03-06 12:30:26 · 297 阅读 · 0 评论 -
用C语言编写贪吃蛇代码(难度可选)
/*****************************************************************************贪吃蛇(难道可选)**********************************制作者:Xu Lizi 日期:2012/12/31****************************部分函数有借鉴***********原创 2013-10-24 17:56:56 · 24449 阅读 · 10 评论 -
LeetCode #3 Longest Substring Without Repeating Characters
Description Given a string, find the length of the longest substring without repeating characters.ExampleGiven “abcabcbb”, the answer is “abc”, which the length is 3.Given “bbbbb”, the answer is “b”, wi原创 2017-02-25 15:16:51 · 266 阅读 · 0 评论 -
LeetCode #2 Add Two Numbers
Description You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers an原创 2017-02-25 15:07:36 · 309 阅读 · 0 评论 -
LeetCode #1 Two Sum
Description Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution, and you may not use原创 2017-02-25 14:53:31 · 306 阅读 · 0 评论 -
Cstore project 的总结
经过一段时间的努力,终于完成了Cstore的原创 2014-07-06 12:45:42 · 540 阅读 · 0 评论 -
strcpy函数的实现
今天看到了一篇博客http://blog.csdn.net/gpengtao/article/details/7464061,博文中对于strcpy的实现方法原创 2014-06-25 22:46:19 · 884 阅读 · 0 评论 -
C++ Alphacode
限制条件时间限制: 1 秒, 内存限制: 32 兆题目描述Alice and Bob need to send secret messages to each other and are discussing ways to encode their messages: Alice: "Let's just use a very simple code: We'll ass原创 2013-11-10 00:26:25 · 1240 阅读 · 0 评论 -
杨氏矩阵的查找
题目描述杨氏矩阵,即在一个二维数组中,每一行都按照从左到右严格递增的顺序排序,每一列都按照从上到下严格递增的顺序排序。请完成一个函数,输入这样的一个N*N的二维数组和M个整数,判断数组中是否含有上述M个整数。你能解决这个问题吗?输入格式可能有多个测试输入,第一行给出总共的测试输入的个数。对于每个测试输入,第一行包含两个正整数N和M,接下来是一个N*N的杨氏矩阵,最后原创 2013-10-30 21:00:32 · 936 阅读 · 1 评论 -
Direct3D 11 学习笔记(一)
Direct3D 11 学习笔记(一)Setting Up The Direct3D 11 Device 第一步,创建三个对象:a device, an immediate context, a swap chain 第二步,创建 render target view 第三部,初始化 viewportdevice context device conte原创 2018-01-19 11:44:01 · 866 阅读 · 0 评论