码迷,mamicode.com
首页 >  
搜索关键字:no write has been do    ( 38312个结果
java-第五章-do{}while()升级菜单切换
importjava.util.Scanner; publicclassA04{ publicstaticvoidmain(String[]args){ //TODOAuto-generatedmethodstub Scannerinput=newScanner(System.in); System.out.println("欢迎使用MyShopPing管理系统"); System.out.println("\n********************************..
分类:编程语言   时间:2014-06-02 14:44:48    阅读次数:378
JSOI2008最大数(线段树)
注意到数列只增不减,而题目中又明确说道my then exit(x) else exit(y); end;procedure build(x,y,k:longint); var mid:longint; begin with t[k] do begin l:=x;r:=y; if ...
分类:Web程序   时间:2014-06-02 14:01:28    阅读次数:247
ZedBoard 引脚约束参考
从ISE转换到Vivado时,UCF转XDC的几种方法: (1)软件自动转换 参考网址:Youtube 用ISE->EDK->PlanAhead打开所需转换的工程文件*.xise,并打开bd 在Tcl Console 栏中 write_xdc -file YourFileFullPath/test....
分类:数据库   时间:2014-06-02 13:42:59    阅读次数:1937
LeetCode: String to Interger (atoi) 题解
Implementatoito convert a string to an integer.Hint:Carefully consider all possible input cases. If you want a challenge, please do not see below and ...
分类:其他好文   时间:2014-06-02 08:51:43    阅读次数:233
汇编-memcpy的实现
memcpystack proc dest,src,cnt ;cnt is a count of dwords ;this function has a granularity of dwords mov edx,src mov eax,dest sub eax...
分类:其他好文   时间:2014-06-02 08:31:34    阅读次数:432
POJ2586——Y2K Accounting Bug
Y2K Accounting BugDescriptionAccounting for Computer Machinists (ACM) has sufferred from the Y2K bug and lost some vital data for preparing annual rep...
分类:其他好文   时间:2014-06-02 00:57:42    阅读次数:386
lua 语句学习
就如同C里的if else,while,do,repeat;就看lua里怎么用: 1、首先看if else t = {1,2,3} local i = 1 if t[i] and t[i] % 2 == 0 then print("even") else print("odd") end lua木有C里的&&,而是and来表示;if 之后跟表达式,之后要更个then 最后语句结束都要...
分类:其他好文   时间:2014-06-01 18:13:48    阅读次数:567
LeetCode: Reverse Linked List II [092]
【题目】 Reverse a linked list from position m to n. Do it in-place and in one-pass. For example: Given 1->2->3->4->5->NULL, m = 2 and n = 4, return 1->4->3->2->5->NULL. Note: Given m, n satisfy the following condition: 1 ≤ m ≤ n ≤ length of list. 【题意】 ...
分类:其他好文   时间:2014-06-01 15:08:34    阅读次数:237
LeetCode: Binary Tree Inorder Traversal [094]
【题目】 Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 2 / 3 return [1,3,2]. Note: Recursive solution is trivial, could you do it iteratively? confused what "{1,#,2...
分类:其他好文   时间:2014-06-01 13:01:23    阅读次数:279
java 编程基础
临近毕业,准备复习一些java的基础,顺便整理一下知识编程基础1.Java的特性和优势:简单、面向对象可移植( write once ,run anywhere )、高性能 ,分布式、动态性多线程安全健壮。2.Java的运行机制, 计算高级编程语言类型有:编译型、解释型. Java语言是这两种类型的...
分类:编程语言   时间:2014-06-01 11:41:26    阅读次数:332
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!