- 博客(24)
- 资源 (2)
- 收藏
- 关注
原创 导入csv文件时,由于可能丢失数据,所以无法转换该值
导入csv文件时,出现如下错误:解决办法:1、将数据库中的该表删掉 2、点“上一步”,如果已经退出当前向导的话,重新导入 3、一直操作到如下画面: 将“出错时”那一栏由“全局”该为“忽略”
2017-03-21 08:49:57 6024
原创 无法启动程序 系统找不到指定的exe文件
解决方法: 1、配置属性—常规—输出文件 那里改为跟提示的名称一致了,比如,将fracture_d.exe改为demo_fracture.exe 2、生成->生成解决方案3、启动调试
2017-03-20 09:22:41 16284 1
原创 无法定位程序输入点 于动态链接库上
在vs2013上编译过了,但在vs2015上编译不过,感觉配置都是对的,仍然会发生这个问题,这时只需把相应的dll根exe文件放在同一目录下就可以了。以下是从http://blog.csdn.net/u012632851/article/details/52280673复制的 1.添加头文件:C/C++——常规——附加包含目录 2.添加文件lib静态路径:链接器——常规——附加库目录 3.添加
2017-03-20 09:17:11 17308 1
原创 leetcode--- Verify Preorder Serialization of a Binary Tree
One way to serialize a binary tree is to use pre-order traversal. When we encounter a non-null node, we record the node’s value. If it is a null node, we record using a sentinel value such as #. _9_/
2017-03-20 07:59:23 365
原创 【游戏核心算法编程内幕】---设计模式
单体模式单体模式是个全局对象,整个应用程序中只有一个实例。首先声明一个类,只有一个公开方法,用于请求单体的实例。第一次请求时生成单体,后面再请求时只是返回该单体的指针。class Singleton{public: static Singleton* Instance();protected: Singleton();private: static Singleton*
2017-03-18 12:43:24 2204
原创 64位系统下通过前向进位实现快速加法
1、void cal() 核心部分,快速加法—前向进位。 2、void trans(int M, int N, char *X, int *result, int &resultLen) 大整数的任意进制转换程序。将M进制数*X转为为N进制数*result。还会得到*result的长度resultLen。 3、辅助函数: void convert()
2017-03-17 20:51:58 570
原创 leetcode---Power of Three
Given an integer, write a function to determine if it is a power of three.class Solution {public: bool isPowerOfThree(int n) { int arr[8]; arr[0] = 3; for(int i=1; i<8
2017-03-17 08:24:37 538
原创 leetcode--- Coin Change---动规
You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money c
2017-03-16 14:52:23 498
原创 leetcode---Maximum Product of Word Lengths
Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assume that each word will contain only lower case lette
2017-03-15 21:57:15 563
原创 leetcode---Count Numbers with Unique Digits---回溯
Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10n.Example: Given n = 2, return 91. (The answer should be the total numbers in the range of 0 ≤ x < 100, excludi
2017-03-14 12:05:08 360
原创 leetcode---Intersection of Two Arrays
Total Accepted: 77145 Total Submissions: 166815 Difficulty: Easy Contributors: Admin Given two arrays, write a function to compute their intersection.Example: Given nums1 = [1, 2, 2, 1], nums2 = [
2017-03-13 14:48:29 667
原创 leetcode---Range Sum Query - Mutable---二叉索引树
Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.The update(i, val) function modifies nums by updating the element at index i to val. Example: Give
2017-03-12 21:29:29 356
转载 Linux---升级C++编译器
1、升级: http://www.mudbest.com/centos升级gcc4-4-7升级gcc4-8手记/ 前6步 2、替换版本: http://www.360doc.com/content/15/1009/17/18525993_504460415.shtml
2017-03-11 18:52:41 3436
原创 leetcode---Find Median from Data Stream---插入排序
Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle value.Examples: [2,3,4] , the median is 3
2017-03-11 09:25:57 636
转载 Linux---将文件复制到虚拟机中
安装vmware tool https://jingyan.baidu.com/article/d5c4b52be75f60da560dc5dd.html可直接将文件拖到虚拟机中,如果仍然不行,共享文件后就可以了 http://jingyan.baidu.com/article/375c8e1997212e25f2a22932.html...
2017-03-10 18:44:54 6746
原创 leetcode---Additive Number
Additive number is a string whose digits can form additive sequence.A valid additive sequence should contain at least three numbers. Except for the first two numbers, each subsequent number in the sequ
2017-03-10 09:08:01 398
原创 结构体可直接赋值
#include "iostream"#include "vector"#include "algorithm"using namespace std;struct C{ int a; vector<int> v; // 从小到大排 bool operator < (const struct C &c) const { return v <
2017-03-09 14:26:57 1876
原创 leetcode--- Minimum Height Trees
For a undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree. Among all possible rooted trees, those with minimum height are called minim
2017-03-09 08:57:53 283
原创 限制颜色数的图着色---遗传算法
要解决的问题: 只用3种颜色完成图着色,使得冲突的边数最少。实际意义为,将3种PSS分配分配给各小区,使得冲突最少。数据集: 邻区关系矩阵#include "iostream"#include "fstream"#include "vector"#include "queue"#include "algorithm"#include "ctime"#include "set
2017-03-08 21:46:31 2138 3
原创 leetcode---Super Ugly Number
Write a program to find the nth super ugly number.Super ugly numbers are positive numbers whose all prime factors are in the given prime list primes of size k. For example, [1, 2, 4, 7, 8, 13, 14, 16,
2017-03-08 08:46:50 410
原创 OpenGL---加载obj模型
obj文件格式介绍:http://www.cnblogs.com/youthlion/archive/2013/01/21/2870451.htmlmesh.h#pragma once#include "vector"#include "iostream"#include "string"#include "fstream"#include "sstream"#include "algor
2017-03-04 16:22:04 3357 4
原创 OpenGL---在平面上贴纹理
bmp.hclass BMP{private: unsigned char * pBitmapData; //纹理对象public: int nRows, nCols; //bmp图像的尺寸 unsigned int texture_id; //纹理ID BMP(){};
2017-03-03 09:14:03 1900
原创 leetcode---Range Sum Query 2D - Immutable---动规
Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2).Range Sum Query 2D The above rectangle (wi
2017-03-02 20:24:42 288
原创 leetcode--- Bulls and Cows---字符串
You are playing the following Bulls and Cows game with your friend: You write down a number and ask your friend to guess what the number is. Each time your friend makes a guess, you provide a hint that
2017-03-02 14:33:25 239
Rx_Net35_SP1
2019-03-13
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人