- 博客(7)
- 收藏
- 关注
RSS订阅原创 LeetCode[6] ZigZag Conversion(java)
题目原地址点击打开链接，本文使用的是找规律，找出每行数字和行数的关系，建立表达式求解。但是效率较低。 public class Solution { public String convert(String s, int numRows) { int len=s.length(); if(len==0||numRows<2) ret
2016-10-29 14:58:57
231
原创 南邮数据结构、算法实践周提高题3（图的连通问题和二叉排序树）
Problem 3 Graph and Tree (Difficulty index ★★★★☆) 3-1. A graph is a set of nodes connected in various ways by edges. You can often start at one node, wander along various edges from node to node, and
2016-10-28 16:09:53
575
原创 南邮数据结构、算法实践周提高题2(Number Games)
A positive integer is considered prime if it is evenly divisible only by itself and 1. Also, by convention, 1 is not itself a prime. Thus, the sequence of primes begins:2, 3, 5, 7, 11, 13, 17, ... A
2016-10-27 16:45:47
677
原创 LeetCode[1] Two Sum (java实现)
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. Example Given nums = [2, 7, 11
2016-10-26 22:18:02
184
原创 南邮汇编实验二(用户登录)
.486 DATA SEGMENT USE16 MESG1 DB 'INPUT USER:$' MESG2 DB 'INPUT PWD:$' USER DB 20 DB ? DB 20 DUP(?) PWD DB 20 DUP(?) U DB 'B14040411' ULENGTH EQU $-U P DB 'B14040411' MLENGTH E
2016-10-25 17:03:12
7080
原创 南邮数据结构、算法实践周基础题3(哈夫曼树及其编码)
是在一位学长的代码上改的，学长勿怪~.~ #include #include #include using namespace std; template class PrioQueue //优先权队列类 { public: PrioQueue(int mSize = 20); ~PrioQueue(){ delete [
2016-10-25 16:58:22
1050
原创 南邮汇编实验一
从BUF单元开始存有一字符串（长度.486 DATA SEGMENT USE16 BUF DB 'ABCDEFGHIJKLMBVCDECDECDCDABCDEFG' COUNT EQU $-BUF DATA ENDS CODE SEGMENT USE16 ASSUME CS:CODE,DS:DATA BEG: MOV AX,DATA MOV DS,AX MOV BL,0 ;计数
2016-10-20 10:58:57
6358
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人