- 博客(105)
- 收藏
- 关注
RSS订阅原创 系统分析与设计-lesson16
lesson 16使用ECB实现make reservation用例的详细设计（包含用例简介，顺序图，类图） 用例简介： 顺序图： 类图： 将逻辑设计类图映射到实际项目框架的包图。用树形结构表述实现的包和类。 具体的项目框架如下：project public(放置公共文件)static(静态文件，例如html,css,js)module (放置ECB模型文件) bo...
2018-06-26 16:38:11
204
原创 系统分析与设计-lesson13
描述软件架构与框架之间的区别与联系 软件架构：软件架构是一个系统的草图。软件架构描述的对象是直接构成系统的抽象组件。各个组件之间的连接则明确和相对细致地描述组件之间的通讯。在实现阶段，这些抽象组件被细化为实际的组件，比如具体某个类或者对象。在面向对象领域中，组件之间的连接通常用接口来实现。软件架构：面向某领域（包括业务领域，如ERP，和计算领域，如GUI）的、可复用的“半成品”软件，它实现了...
2018-06-09 19:23:53
365
原创 系统分析与设计-lesson9
Forest建模练习对Forest App进行建模练习文档参考Forest应用建模要求包括（用例图、XX业务或用例的活动图、XX领域模型、XX对象的状态图、XX场景的系统顺序图与操作协议）用例图活动图领域模型状态图系统顺序图...
2018-05-13 17:18:21
321
1
原创 系统分析与设计-lesson8
使用 UML State Model建模对象： 参考 Asg_RH 文档， 对 Reservation/Order 对象建模。建模要求： 参考练习不能提供足够信息帮助你对订单对象建模，请参考现在 定旅馆 的旅游网站，尽可能分析围绕订单发生的各种情况，直到订单通过销售事件（柜台销售）结束订单。 研究淘宝退货流程活动图，对退货业务对象状态建模
2018-05-06 17:43:51
193
原创 系统分析与设计-lesson7
a.阅读 Asg_RH 文档，按用例构建领域模型。按Task2 要求，请使用工具 UMLet，截图格式务必是 png 并控制尺寸说明：请不要受 PCMEF 层次结构影响。你需要识别实体（E）和 中介实体（M，也称状态实体） b.数据库建模(E-R 模型)按 Task 3 要求，给出系统的 E-R 模型（数据逻辑模型）建模工具 PowerDesigner（简称PD） 或开源工具 OpenSyste
2018-04-28 22:10:34
207
原创 系统分析与设计-lesson6
1、用例建模a.读 Asg_RH 文档，绘制用例图。 按 Task1 要求，请使用工具 UMLet，截图格式务必是 png 并控制尺寸 b.选择你熟悉的定旅馆在线服务系统（或移动 APP），如绘制用例图。并满足以下要求： c.对比两个时代、不同地区产品的用例图，总结在项目早期，发现创新的思路与方法 在项目早期，都是以用户的主要需求的实现为主，例如搜索酒店以及预订酒店，以这为主要需求，然后创新一般
2018-04-20 18:37:16
234
原创 系统分析与设计-lesson2
1.简答题简述瀑布模型、增量模型、螺旋模型（含原型方法）的优缺点。 1.瀑布模型核心思想是按工序将问题化简，将功能的实现与设计分开，便于分工协作，即采用结构化的分析与设计方法将逻辑实现与物理实现分开。将软件生命周期划分为制定计划、需求分析、软件设计、程序编写、软件测试和运行维护等六个基本活动，并且规定了它们自上而下、相互衔接的固定次序，如同瀑布流水，逐级下落。 优点有：为项目提供了按阶段...
2018-03-18 16:31:05
295
原创 系统分析与设计-lesson1
一、简单题软件工程的定义将系统化、规范化、可度量的方法应用于软件的开发、运行和维护的过程，即将工程化应用于软件中。软件工程是指导计算机软件开发和维护的工程学科。采用工程的概念、原理、技术和方法来开发与维护软件，把经过实践考验而证明正确的管理技术和当前能够得到的最好的技术方法结合起来，这就是软件工程。阅读经典名著“人月神话”等资料，解释 software crisis
2018-03-11 22:41:24
201
原创 123. Best Time to Buy and Sell Stock III
Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete at most two transactions.Note:You may
2018-01-12 16:57:48
146
原创 79. Word Search
Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically
2018-01-03 16:01:36
819
原创 37. Sudoku Solver
Write a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by the character '.'.You may assume that there will be only one unique solution.A sudoku
2018-01-03 15:03:46
143
原创 22. Generate Parentheses
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:[ "((()))", "(()())", "(())()", "()(())",
2018-01-02 17:24:06
154
原创 40. Combination Sum II
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.Each number in C may only be used once in the combina
2018-01-01 15:34:19
190
原创 39. Combination Sum
Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be chosen
2017-12-29 12:30:42
169
原创 93. Restore IP Addresses
Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given "25525511135",return ["255.255.11.135", "255.255.111.35"]. (Order
2017-12-28 18:31:38
185
原创 51. N-Queens
The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.Given an integer n, return all distinct solutions to the n-queens puzzle.E
2017-12-28 17:59:14
167
原创 63. Unique Paths II
Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respectively in the
2017-12-28 17:18:41
146
原创 62. Unique Paths
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the
2017-12-27 15:15:42
183
原创 131. Palindrome Partitioning
Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.For example, given s = "aab",Return[ ["aa","b"], [
2017-12-25 10:46:30
152
原创 120. Triangle
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [3,4], [
2017-12-21 17:50:20
148
原创 3. Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters.Examples:Given "abcabcbb", the answer is "abc", which the length is 3.Given "bbbbb", the answer is "
2017-12-21 12:23:07
288
原创 122. Best Time to Buy and Sell Stock II
Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy on
2017-12-21 11:22:53
139
原创 121. Best Time to Buy and Sell Stock
Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock),
2017-12-21 10:58:48
133
原创 45. Jump Game II
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Your goal i
2017-12-20 15:55:04
157
原创 55. Jump Game
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Determine i
2017-12-19 20:05:12
129
原创 50. Pow(x, n)
Implement pow(x, n).Example 1:Input: 2.00000, 10Output: 1024.00000Example 2:Input: 2.10000, 3Output: 9.26100
2017-12-19 19:13:10
155
原创 78. Subsets
Given a set of distinct integers, nums, return all possible subsets (the power set).Note: The solution set must not contain duplicate subsets.For example,If nums = [1,2,3], a solution is:
2017-12-11 10:20:12
163
原创 74. Search a 2D Matrix
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left to right.The first integer of each
2017-12-10 19:20:04
1983
原创 34. Search for a Range
Given an array of integers sorted in ascending order, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the order of O(log n).If the
2017-12-10 11:40:19
108
原创 75. Sort Colors
Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integers
2017-12-10 11:05:09
133
原创 41. First Missing Positive
Given an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algorithm should run in O(n) time and uses constant
2017-12-08 11:21:46
115
原创 147. Insertion Sort List
Sort a linked list using insertion sort.这一题题目比较简单，就是给出一个链表序列，然后用插入排序的方法对其进行排序。那么一般链表的操作，在前面加上dummy的话，操作起来会更简单，因为需要一个prev指针来指向前面一个位置，代码如下。Code(LeetCode运行56ms)/** * Definition for singly-li
2017-12-07 11:03:05
121
原创 23. Merge k Sorted Lists
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.由题意得，就是给出K个排序好的链表序列，然后把它们都合并起来。因为这一题的上一个题目是merge two sorted lists，所以每次都合并两个序列，然后就可以了，但是显然这样时
2017-12-07 10:18:39
135
原创 129. Sum Root to Leaf Numbers
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number 123.Find the tota
2017-12-06 15:59:32
100
原创 124. Binary Tree Maximum Path Sum
Given a binary tree, find the maximum path sum.For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The
2017-12-06 10:34:38
123
原创 113. Path Sum II
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree and sum = 22, 5 / \
2017-12-05 19:29:07
160
原创 112. Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below binary tree and sum
2017-12-04 09:29:20
125
原创 109. Convert Sorted List to Binary Search Tree
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.For this problem, a height-balanced binary tree is defined as a binary tree in which th
2017-12-01 11:08:09
139
原创 108. Convert Sorted Array to Binary Search Tree
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.由题意得，给出一个递增的序列，然后求出它的高度平衡的二叉搜索树。题目比较简单，就用二分法，每次取序列的一半来作为子树的根的结点值，用递归的方法就可以实现，代码如下。Code(LeetCo
2017-11-29 09:39:58
152
原创 98. Validate Binary Search Tree
Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less than the node's key.Th
2017-11-27 17:19:41
147
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人