Co_zy的博客

有时C/C++代码在Codeblocks上不能很好的运行，这是由于代码不标准造成的，Codeblocks编译器默认是GNU GCC，GCC遵循C++标准，而VC++是不太一样的。这篇文章介绍在Codeblocks下如何编译、调试VC 6.0的项目。（有错误的话请指正^_^） 条件 1、安装好Codeblocks16.01带MinGW 2、安装好VC++6.0(路径C:\Program File

#!/usr/bin/python# -*- coding: utf-8 -*-list1 = [3, 7, 8, 9, 12]list2 = [5, 6, 10, 13, 25, 30]result = []while list1 and list2: if list1[0] < list2[0]: result.append(list1[0]) l

class PrioQue(object): #elist=[]做参数很危险 def __init__(self,elist=[]): self._elems = list(elist) #元素从大到小排序,最后为队首 self._elems.sort(reverse = True) def enqueue(self,e):

class TreeNode(object): def __init__(self,data = 0,left = 0,right = 0): self.data = data self.left = left self.right = rightclass BTree(object): """docstring for BTr

当队列中没有元素时,head和tail都是-1,当进如一个元素时,如下图,此时tail加1,也就是inQueue函数中self.tail += 1 class Queue(object): """docstring for Queue""" def __init__(self,size): self.queue = [] self.size = siz

Given a linked list, determine if it has a cycle in it.Follow up: Can you solve it without using extra space?

win10添加MinGW环境变量 右键计算机->属性->高级系统设置->环境变量 把我们gcc的路径 C:\MinGW\bin 添加进去sublime搭建c/c++环境 http://www.yalewoo.com/sublime_text_3_gcc.html

class LNode(object): def __init__(self,elem,next=None): self.elem = elem self.next = nextclass LStack(LNode): def __init__(self): self._top = None def is_empty(self):

Given a sorted linked list, delete all duplicates such that each element appear only once.For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1->2->3.c++实现ListNode* deleteDuplicates(

class Stack(object): """docstring for Stack""" def __init__(self, size): self.stack = [] self.size = size self.top = -1 def push(self,content): if self.full()