<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[SYSU_WangLF的博客]]></title><description><![CDATA[1]]></description><link>https://blog.youkuaiyun.com/a2487304484</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; a2487304484]]></copyright><item><title><![CDATA[系统分析与设计lesson16]]></title><link>https://blog.youkuaiyun.com/a2487304484/article/details/80878374</link><guid>https://blog.youkuaiyun.com/a2487304484/article/details/80878374</guid><author>a2487304484</author><pubDate>Sun, 01 Jul 2018 23:05:20 +0800</pubDate><description><![CDATA[使用 ECB 实现 make reservation 用例的详细设计（包含用例简介，顺序图，类图）用例图顺序图类图将逻辑设计类图映射到实际项目框架的包图。用树形结构表述实现的包和类...]]></description><category></category></item><item><title><![CDATA[15331296——DramaticTickets Final Report]]></title><link>https://blog.youkuaiyun.com/a2487304484/article/details/80871414</link><guid>https://blog.youkuaiyun.com/a2487304484/article/details/80871414</guid><author>a2487304484</author><pubDate>Sun, 01 Jul 2018 00:46:24 +0800</pubDate><description><![CDATA[个人报告PSP2.1统计表PSP2.1Personal Software Process StagesTime(h)Planning计划3Estimate估计任务时间3Development开发160Analysis需求分析7Design Spec生成设计文档5Design Review设计复审10Coding Standard代码规范5Design具体设计6Coding具体编码80Code Re...]]></description><category></category></item><item><title><![CDATA[系统分析与设计lesson13]]></title><link>https://blog.youkuaiyun.com/a2487304484/article/details/80560921</link><guid>https://blog.youkuaiyun.com/a2487304484/article/details/80560921</guid><author>a2487304484</author><pubDate>Sun, 03 Jun 2018 22:36:39 +0800</pubDate><description><![CDATA[描述软件架构与框架之间的区别与联系以你的项目为案例绘制三层架构模型图，细致到分区结合你程序的结构，从程序员角度说明三层架构给开发者带来的便利研究 VUE 与 Flux 状态管理的异同1.软件架构与框架之间的区别与联系    软件架构是一个系统的草图。软件架构描述的对象是直接构成系统的抽象组件，描述这些部件的职责及它们之间的协作行为。    框架是特定语言和技术的架构应用解决方案，是某种半成品，供人...]]></description><category></category></item><item><title><![CDATA[系统分析与设计lesson8]]></title><link>https://blog.youkuaiyun.com/a2487304484/article/details/80219163</link><guid>https://blog.youkuaiyun.com/a2487304484/article/details/80219163</guid><author>a2487304484</author><pubDate>Sun, 06 May 2018 22:37:46 +0800</pubDate><description><![CDATA[1）使用 UML State Model建模对象： 参考 Asg_RH 文档， 对 Reservation/Order 对象建模。建模要求： 参考练习不能提供足够信息帮助你对订单对象建模，请参考现在 定旅馆 的旅游网站，尽可能分析围绕订单发生的各种情况，直到订单通过销售事件（柜台销售）结束订单。2）研究淘宝退货流程活动图，对退货业务对象状态建模...]]></description><category></category></item><item><title><![CDATA[系统分析与设计lesson7]]></title><link>https://blog.youkuaiyun.com/a2487304484/article/details/80182948</link><guid>https://blog.youkuaiyun.com/a2487304484/article/details/80182948</guid><author>a2487304484</author><pubDate>Thu, 03 May 2018 18:11:37 +0800</pubDate><description><![CDATA[1、 领域建模a. 阅读 Asg_RH 文档，按用例构建领域模型。按 Task2 要求，请使用工具 UMLet，截图格式务必是 png 并控制尺寸说明：请不要受 PCMEF 层次结构影响。你需要识别实体（E）和 中介实体（M，也称状态实体）在单页面应用（如 vue）中，E 一般与数据库构建有关， M 一般与 store 模式 有关在 java web 应用中，E 一般与数据库构建有关， M 一般与...]]></description><category></category></item><item><title><![CDATA[10_domain_model.png]]></title><link>https://blog.youkuaiyun.com/a2487304484/article/details/80146249</link><guid>https://blog.youkuaiyun.com/a2487304484/article/details/80146249</guid><author>a2487304484</author><pubDate>Sun, 29 Apr 2018 22:41:27 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[系统分析与设计04]]></title><link>https://blog.youkuaiyun.com/a2487304484/article/details/80056651</link><guid>https://blog.youkuaiyun.com/a2487304484/article/details/80056651</guid><author>a2487304484</author><pubDate>Mon, 23 Apr 2018 21:32:43 +0800</pubDate><description><![CDATA[1、 用例建模a. 阅读 Asg_RH 文档，绘制用例图。 按 Task1 要求，请使用工具 UMLet，截图格式务必是 png 并控制尺寸b. 选择你熟悉的定旅馆在线服务系统（或移动 APP），如绘制用例图。并满足以下要求：- 对比 Asg_RH 用例图，请用色彩标注出创新用例或子用例- 尽可能识别外部系统，并用色彩标注新的外部系统和服务c. 对比两个时代、不同地区产品的用例图，总结在项目早期，...]]></description><category></category></item><item><title><![CDATA[系统分析与设计02]]></title><link>https://blog.youkuaiyun.com/a2487304484/article/details/79661833</link><guid>https://blog.youkuaiyun.com/a2487304484/article/details/79661833</guid><author>a2487304484</author><pubDate>Fri, 23 Mar 2018 00:01:29 +0800</pubDate><description><![CDATA[一、简单题 
1.简述瀑布模型、增量模型、螺旋模型（含原型方法）的优缺点。

瀑布模型： 
优点： 
1.有利于大型软件开发过程中人员的组织、管理，有利于软件开发方法和工具的研究，从而提高了大型软件项目开发的质量和效率。 
2.强调在软件实现前必须进行分析和设计工作。

缺点： 
1.开发过程一般不能逆转，缺乏灵活性。 
2.用户只有在开发后期才能看到项目模型。 
3.预期软件往往与最后实际效果有...]]></description><category></category></item><item><title><![CDATA[系统分析与设计01]]></title><link>https://blog.youkuaiyun.com/a2487304484/article/details/79574524</link><guid>https://blog.youkuaiyun.com/a2487304484/article/details/79574524</guid><author>a2487304484</author><pubDate>Thu, 15 Mar 2018 21:37:18 +0800</pubDate><description><![CDATA[一、简单题 
1.软件工程的定义


系统地应用科学技术知识，方法和经验来设计，实施，测试和记录软件
一个系统的，规范的，可量化的方法来开发，运行的应用程序，以及维护的软件 
一个涉及软件生产各个方面的工程学科
建立和使用合理的工程原理，以便经济地获得可靠的软件，并在真机上高效运行


2.阅读经典名著“人月神话”等资料，解释software crisis，COCOMO模型


software ...]]></description><category></category></item><item><title><![CDATA[算法分析与设计——LeetCode Problem.5 Longest Palindromic Substring]]></title><link>https://blog.youkuaiyun.com/a2487304484/article/details/79500123</link><guid>https://blog.youkuaiyun.com/a2487304484/article/details/79500123</guid><author>a2487304484</author><pubDate>Fri, 09 Mar 2018 17:09:08 +0800</pubDate><description><![CDATA[问题详情

Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.

Example:



Input: &quot;babad&quot;

Output: &quot;bab&quot;

Note: &quot;aba&quot; is also a valid answer...]]></description><category></category></item><item><title><![CDATA[算法分析与设计——LeetCode Problem.3 Longest Substring Without Repeating Characters]]></title><link>https://blog.youkuaiyun.com/a2487304484/article/details/79462089</link><guid>https://blog.youkuaiyun.com/a2487304484/article/details/79462089</guid><author>a2487304484</author><pubDate>Tue, 06 Mar 2018 18:36:58 +0800</pubDate><description><![CDATA[问题详情

Given a string, find the length of the longest substring without repeating characters.

Examples:

Given &quot;abcabcbb&quot;, the answer is &quot;abc&quot;, which the length is 3.

Given &quot;bbbbb&quot;, the answer is &quot;b&quot;...]]></description><category></category></item><item><title><![CDATA[算法分析与设计——LeetCode Problem.1 Two Sum]]></title><link>https://blog.youkuaiyun.com/a2487304484/article/details/79444239</link><guid>https://blog.youkuaiyun.com/a2487304484/article/details/79444239</guid><author>a2487304484</author><pubDate>Mon, 05 Mar 2018 12:13:24 +0800</pubDate><description><![CDATA[问题详情



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, and you may not use t...]]></description><category></category></item><item><title><![CDATA[算法分析与设计——LeetCode Problem.258 Add Digits]]></title><link>https://blog.youkuaiyun.com/a2487304484/article/details/79116664</link><guid>https://blog.youkuaiyun.com/a2487304484/article/details/79116664</guid><author>a2487304484</author><pubDate>Sat, 20 Jan 2018 20:47:27 +0800</pubDate><description><![CDATA[问题详情

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.

Note: You can only move either down or righ]]></description><category></category></item><item><title><![CDATA[算法分析与设计——LeetCode Problem.33 Search in Rotated Sorted Array]]></title><link>https://blog.youkuaiyun.com/a2487304484/article/details/79116571</link><guid>https://blog.youkuaiyun.com/a2487304484/article/details/79116571</guid><author>a2487304484</author><pubDate>Sat, 20 Jan 2018 20:31:21 +0800</pubDate><description><![CDATA[问题详情

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).

You are given a target value to search. If foun]]></description><category></category></item><item><title><![CDATA[算法分析与设计——LeetCode Problem.598 Range Addition II]]></title><link>https://blog.youkuaiyun.com/a2487304484/article/details/78992430</link><guid>https://blog.youkuaiyun.com/a2487304484/article/details/78992430</guid><author>a2487304484</author><pubDate>Sat, 06 Jan 2018 23:20:53 +0800</pubDate><description><![CDATA[问题详情

Given an m * n matrix M initialized with all 0’s and several update operations.

Operations are represented by a 2D array, and each operation is represented by an array with two positive integer]]></description><category></category></item><item><title><![CDATA[算法分析与设计——LeetCode Problem.22 Generate Parentheses]]></title><link>https://blog.youkuaiyun.com/a2487304484/article/details/78992208</link><guid>https://blog.youkuaiyun.com/a2487304484/article/details/78992208</guid><author>a2487304484</author><pubDate>Sat, 06 Jan 2018 22:41:48 +0800</pubDate><description><![CDATA[问题详情

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:

[
  "((()))",
  "(()())",
  "(())()",
  "()]]></description><category></category></item><item><title><![CDATA[算法分析与设计——LeetCode Problem.451 Sort Characters By Frequency]]></title><link>https://blog.youkuaiyun.com/a2487304484/article/details/78988206</link><guid>https://blog.youkuaiyun.com/a2487304484/article/details/78988206</guid><author>a2487304484</author><pubDate>Sat, 06 Jan 2018 13:30:44 +0800</pubDate><description><![CDATA[问题详情



Given a string, sort it in decreasing order based on the frequency of characters.

Example 1:



Input:
"tree"

Output:
"eert"

Explanation:
'e' appears twice while 'r' and 't' both appear onc]]></description><category></category></item><item><title><![CDATA[算法分析与设计——LeetCode Problem.46 Permutations]]></title><link>https://blog.youkuaiyun.com/a2487304484/article/details/78987988</link><guid>https://blog.youkuaiyun.com/a2487304484/article/details/78987988</guid><author>a2487304484</author><pubDate>Sat, 06 Jan 2018 12:49:16 +0800</pubDate><description><![CDATA[问题详情



Given a collection of distinct numbers, return all possible permutations.

For example,



[1,2,3] have the following permutations:
[
  [1,2,3],
  [1,3,2],
  [2,1,3],
  [2,3,1],
  [3,1,2],
  []]></description><category></category></item><item><title><![CDATA[算法分析与设计——LeetCode Problem.547 Friend Circles]]></title><link>https://blog.youkuaiyun.com/a2487304484/article/details/78980058</link><guid>https://blog.youkuaiyun.com/a2487304484/article/details/78980058</guid><author>a2487304484</author><pubDate>Fri, 05 Jan 2018 13:02:14 +0800</pubDate><description><![CDATA[问题详情



There are N students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a direct friend of B, and B is a direct friend of]]></description><category></category></item><item><title><![CDATA[算法分析与设计——LeetCode Problem.40 Combination Sum II]]></title><link>https://blog.youkuaiyun.com/a2487304484/article/details/78976748</link><guid>https://blog.youkuaiyun.com/a2487304484/article/details/78976748</guid><author>a2487304484</author><pubDate>Thu, 04 Jan 2018 23:58:49 +0800</pubDate><description><![CDATA[问题详情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 combinatio]]></description><category></category></item></channel></rss>