- 博客(85)
- 收藏
- 关注
原创 影评系统的机遇和挑战
一.影评系统的背景 大约在2003年以前,中国的互联网还没有专门讨论电影的社区及网站,人们在观影前主要还是通过发行公司提供的相关资讯来了解电影,网民舆论范围不广且自主认识权较小。而美国的影评行业发展得比较早,在20世纪九十年代,专业影评网站,像IMDB、烂番茄、Metacritic等会对已经上映过的电影进行综合打分以及评论分析,同时将即将上映的电影选出排名前列的电影放置首页标题位置...
2019-06-24 00:19:16 842
原创 JSP学习笔记
一.JSP技术简介 Java语言因为具备着不依赖于平台、面向对象、安全等优良特性而在众多程序设计语言中备受青睐。目前,许多与Java有关的技术得到了广泛的应用和认可,由SUN公司开发的JSP(Java Server Page)技术就是其中之一。JSP是基于Java语言的一种动态网站开发技术。JSP具有嵌入式的特性,它可以和传统的HTML代码结合,将JAVA代码嵌入到其中进行扩展,在...
2019-06-23 22:30:40 381
原创 系统分析与设计第六次作业
1、使用类图,分别对 Asg_RH 文档中 Make Reservation 用例以及 Payment 用例开展领域建模。然后,根据上述模型,给出建议的数据表以及主要字段,特别是主键和外键Make Reservation 用例 Customer(ID/key, FullName, EmailAdress)City(ID/key, CityName)Hotel(ID/key, ...
2019-05-04 20:30:00 486
原创 系统分析与设计第五次作业
1、根据订旅馆建模文档,Asg-RH.pdf绘制用例图模型(到子用例)给出 make reservation 用例的活动图2、根据课程练习“投递员使用投递箱给收件人快递包裹”的业务场景分别用多泳道图建模三个场景的业务过程 x科技公司发明了投递柜,它们自建了投递柜以及远程控制系统。注册的投递员在推广期免费使用投递柜。由于缺乏资源,仅能使用y移动平台向客户发送短信通知。 ...
2019-05-04 17:55:46 205
原创 系统分析与设计第四次作业
1、简答题用例的概念 答:用例是在不展现一个系统或子系统内部结构的情况下,对系统或子系统的某个连贯的功能单元的定义和描述。用例和场景的关系?什么是主场景或 happy path? 答:场景是actors和系统之间特定的一系列动作和绘画,是用例的实例。一个用例是一些场景的集合。主成功场景或happypath是用例从触发事件开始,一步一步执行,最终满足用例利益...
2019-04-13 12:38:12 430
原创 系统分析与设计第三次作业
简答题: 简述瀑布模型、增量模型、螺旋模型(含原型方法)的优缺点,从项目特点、风险特征、人力资源利用角度思考:(1)瀑布模型:优点是降低了软件开发的复杂度,提高了软件开发的透明度,增强了可管理性;以项目的阶段评审和文档控制为手段有效地对整个开发过程进行指导,保证了阶段之间的正确衔接,能够及时发现并纠正开发过程中存在的缺陷,使产品达到预期的质量要求。缺点是各个阶段的划分完全固定,阶段之间产生大...
2019-04-08 20:25:26 244
原创 系统分析与设计第二次作业
简答题: 用简短的语言给出对分析、设计的理解:分析就是对用户给出的软件功能等方面的需求进行系统的研究,识别出主号问题,确定待开发软件的功能、性能、接口、数据、界面等具体的细节要求。设计就是基于需求分析中得到的需求,构造出目标系统的逻辑模型,最终得到一个可供编码过程参考的设计模型文档。 用一句话描述面向对象的分析与设计的优势:根据流行的统一过程指南,现代软件工程中的OOAD最好是以迭...
2019-03-11 18:11:36 260
原创 系统分析与设计第一次作业
简答题: 软件工程的定义:软件工程是应用计算机科学、数学、逻辑学及管理科学等原理,开发软件的工程。软件工程借鉴传统工程的原则、方法,以提高质量、降低成本和改进算法。其中,计算机科学、数学用于构建模型与算法,工程科学用于制定规范、设计范型(paradigm)、评估成本及确定权衡,管理科学用于计划、资源、质量、成本等管理。 解释导致 software crisis 本质原因、表现,述说...
2019-03-10 22:46:29 377
原创 15算法课程 345. Reverse Vowels of a String
Write a function that takes a string as input and reverse only the vowels of a string.Example 1:Given s = "hello", return "holle".Example 2:Given s = "leetcode", return "leotcede".so
2018-01-05 21:57:21 307
原创 15算法课程 课后习题8.3
题目:STINGY SAT is the following problem: given a set of clauses (each a disjunction of literals) and an integer k, find a satisfying assignment in which at most k variables are true, if such an assig
2017-12-28 14:29:24 330
原创 15算法课程 344. Reverse String
Write a function that takes a string as input and returns the string reversed.Example:Given s = "hello", return "olleh".solution:字符串反转code:class Solution {public: string
2017-12-22 23:29:29 175
原创 15算法课程 342. Power of Four
Given an integer (signed 32 bits), write a function to check whether it is a power of 4.Example:Given num = 16, return true. Given num = 5, return false.Follow up: Could you solve it without
2017-12-22 23:24:22 188
原创 15算法课程 326. Power of Three
Given an integer, write a function to determine if it is a power of three.Follow up:Could you do it without using any loop / recursion?solution:一行代码解决code:class Solution {publ
2017-12-22 23:22:20 184
原创 15算法课程 303. Range Sum Query - Immutable
Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.Example:Given nums = [-2, 0, 3, -5, 2, -1]sumRange(0, 2) -> 1sumRange(2, 5) -> -1su
2017-12-22 23:18:50 213
原创 15算法课程 292. Nim Game
You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will be
2017-12-22 23:09:08 180
原创 15算法课程 290. Word Pattern
Given a pattern and a string str, find if str follows the same pattern.Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in str.
2017-12-14 12:02:22 217
原创 15算法课程 283. Move Zeroes
Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], after calling your
2017-12-14 11:53:36 204
原创 15算法课程 278. First Bad Version
You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on
2017-12-14 11:47:35 186
原创 15算法课程 268. Missing Number
Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.Example 1Input: [3,0,1]Output: 2Example 2Input: [9,6,4,2,3,5,7,0,
2017-12-14 11:41:43 154
原创 15算法课程 263. Ugly Number
Write a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ugly
2017-12-14 11:36:23 175
原创 15算法课程 258. Add Digits
Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has on
2017-12-07 12:33:11 183
原创 15算法课程 257. Binary Tree Paths
Given a binary tree, return all root-to-leaf paths.For example, given the following binary tree: 1 / \2 3 \ 5All root-to-leaf paths are:["1->2->5", "1->3"]solut
2017-12-07 12:29:05 198
原创 15算法课程 242. Valid Anagram
Given two strings s and t, write a function to determine if t is an anagram of s.For example,s = "anagram", t = "nagaram", return true.s = "rat", t = "car", return false.solution:用一个
2017-12-07 12:20:22 189
原创 15算法课程 237. Delete Node in a Linked List
Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with v
2017-12-07 12:12:11 173
原创 15算法课程 235. Lowest Common Ancestor of a Binary Search Tree
Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined be
2017-12-07 12:07:06 155
原创 15算法课程 234. Palindrome Linked List
Given a singly linked list, determine if it is a palindrome.Follow up:Could you do it in O(n) time and O(1) space?solution:遍历一次链表维护一个数组并存储对应value,再从头遍历链表的同时从尾部遍历数组,并进行比较code:/*
2017-12-02 13:13:32 164
原创 15算法课程 232. Implement Queue using Stacks
Implement the following operations of a queue using stacks.push(x) -- Push element x to the back of queue.pop() -- Removes the element from in front of queue.peek() -- Get the front element.em
2017-12-02 13:08:08 255
原创 15算法课程 231. Power of Two
Given an integer, write a function to determine if it is a power of two.solution:用二进制的特点code:class Solution {public: bool isPowerOfTwo(int n) { return n > 0 && !(n&(n-1)
2017-12-02 13:02:06 190
原创 15算法课程 225. Implement Stack using Queues
Implement the following operations of a stack using queues.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get the top element.empty() -- Return
2017-12-02 12:58:31 158
原创 15算法课程 219. Contains Duplicate II
Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the absolute difference between i and j is at
2017-12-02 12:51:52 153
原创 15算法课程 217. Contains Duplicate
Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every elemen
2017-11-23 11:59:39 197
原创 15算法课程 206. Reverse Linked List
Reverse a singly linked list.click to show more hints.solution:对当前结点的下一结点做递归,返回倒置后的链表,之后使当前结点的下一结点指向当前结点,当前结点指向NULLcode:class Solution {public: ListNode* reverseList(ListNod
2017-11-23 11:54:16 162
原创 15算法课程 205. Isomorphic Strings
Given two strings s and t, determine if they are isomorphic.Two strings are isomorphic if the characters in s can be replaced to get t.All occurrences of a character must be replaced with anot
2017-11-23 11:50:03 195
原创 15算法课程 204. Count Primes
Description:Count the number of prime numbers less than a non-negative number, n.solution:埃拉托色尼筛选法,针对自然数列中的自然数而实施的,用于求一定范围内的质数。一个合数总是可以分解成若干个质数的乘积,那么如果把质数的倍数都去掉,那么剩下的就是质数了。 任意合数肯定都有一
2017-11-23 11:42:08 161
原创 15算法课程 203. Remove Linked List Elements
Remove all elements from a linked list of integers that have value val.ExampleGiven: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6Return: 1 --> 2 --> 3 --> 4 --> 5solution:遍历链表中所有点,
2017-11-23 11:38:10 143
原创 15算法课程 202. Happy Number
Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squar
2017-11-16 12:35:11 167
原创 15算法课程 198. House Robber
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent
2017-11-16 12:27:42 210
原创 15算法课程 191. Number of 1 Bits
Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as the Hamming weight).For example, the 32-bit integer ’11' has binary representation 0000
2017-11-16 12:22:56 182
原创 15算法课程 190. Reverse Bits
Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as 00111001011
2017-11-16 11:55:54 182
原创 15算法课程 189. Rotate Array
Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].Note:Try to come up as many solutions as yo
2017-11-16 11:50:01 171
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人