- 博客(43)
- 收藏
- 关注
RSS订阅原创 使用Hbuilder开发App，打包App
工具Hbuilder是由DCloud推出的一款支持HTML5的Web开发IDE。支持开发视图、边改边看模式、webview调试模式、团队同步视图。也可以连接真机或使用模拟器直接运行。由于使用了MUI的一些组件，并且本次的运行环境定位于点餐商家界面的移动APP。真机的好处在于可以使用一些只有真机才支持的API，而且没有跨域问题。因此，我下载了安卓模拟器，以运行调试。边看边改模拟器运行APP打包Hbu...
2018-07-07 00:46:19
2408
原创 系统分析与设计lesson16
ECB 实现 make reservation 用例的详细设计（包含用例简介，顺序图，类图）用例简介顺序图类图将逻辑设计类图映射到实际项目框架的包图。用树形结构表述实现的包和类...
2018-07-01 16:23:04
119
原创 系分-团队作业个人FinalReport
个人自我总结本次项目中，我负责的是前端商家界面的开发，使用了mui的UI框架，jquery。我规定了商家要有创建食物、删除食物、请求订单、读取历史订单、读取所有食物这5个业务，客户端要有读取菜单和提交订单这两个业务。我初步规定了前端后端交互的json数据格式，但有一些不完善的设计。在开发的过程中，后端的同学Kimgl、zhuwh9帮助完善了数据的格式。在测试的时候，后端的同学也非常地配合。在请求没...
2018-06-30 22:09:11
169
原创 系统分析与设计lesson13
描述软件架构与框架之间的区别与联系软件架构就是把系统分解为一些部件，描述这些部件的职责及它们之间的协作行为。框架是特定语言和技术的架构应用解决方案。框架是一种特殊的软件，它并不能提供完整无缺的解决方案，而是为你构建解决方案提供良好的基础。框架是半成品。架构不是软件，而是关于软件如何设计的重要策略。软件架构决策设计到如何将软件系统分解成不同的部分、各部分之间的静态结构关系和动态交互关系等。经过完整的...
2018-06-03 21:59:13
180
原创 系统分析与设计-建模练习
App链接：https://github.com/OrderingService/Dashboard/blob/gh-pages/XX_exercise/XX1-Keep.pdf用例图：活动图：领域模型：状态图：系统顺序图：
2018-05-13 17:42:46
261
原创 系统分析与设计lesson8
建模工具： UMLet 14.1.1 stand-alone1）使用 UML State Model建模对象： 参考 Asg_RH 文档， 对 Reservation/Order 对象建模。建模要求： 参考练习不能提供足够信息帮助你对订单对象建模，请参考现在 定旅馆 的旅游网站，尽可能分析围绕订单发生的各种情况，直到订单通过销售事件（柜台销售）结束订单。2）研究淘宝退货流程活动图，对退货业务对象状...
2018-05-06 16:56:58
88
原创 系统分析与设计lesson7
1、 领域建模a. 阅读 Asg_RH 文档，按用例构建领域模型。按 Task2 要求，请使用工具 UMLet，截图格式务必是 png 并控制尺寸说明：请不要受 PCMEF 层次结构影响。你需要识别实体（E）和 中介实体（M，也称状态实体）在单页面应用（如 vue）中，E 一般与数据库构建有关， M 一般与 store 模式 有关在 java web 应用中，E 一般与数据库构建有关， M 一般与...
2018-04-29 19:53:12
102
原创 learn about react with me-初识react
What is React?React is a declarative, efficient, and flexible JavaScript library for building user interfaces.React Use JSX to replace custom JavaScript.JSX looks like an XML version of JavaScript. Re...
2018-04-15 11:09:24
164
原创 系分hw2简答题
1、简答题简述瀑布模型、增量模型、螺旋模型（含原型方法）的优缺点。瀑布模型的优势是定义了软件开发基本流程与活动；为项目提供了按阶段划分的检查点；当前一阶段完成后，您只需要去关注后续阶段；可在迭代模型中应用瀑布模型。 瀑布模型的缺点是各个阶段的划分完全固定，阶段之间产生大量的文档，极大地增加了工作量；由于开发模型是线性的，用户只有等到整个过程的末期才能见到开发成果，从而增加了开发风险；通过过多的强制...
2018-03-22 23:08:36
175
原创 系统分析与设计hw1简答
1、简单题软件工程的定义软件工程是指导计算机软件开发和维护的工程学科。采用工程的概念、原理、技术和方法来开发与维护软件，把经过实践考验而证明正确的管理技术和当前能够得到的最好的技术方法结合起来，这就是软件工程。阅读经典名著“人月神话”等资料，解释 software crisis、COCOMO 模型。Software crisis is a term used in the early d...
2018-03-14 22:58:11
163
原创 8.15最大公共子图
证明如下问题是NP-完全的： 输入：两个图G1=(V1,E1)和G2=(V2,E2)；预算b 输出：两个节点集合V1‘属于V1，V2'属于V2，它们被移除后，将在两图中分别留下至少b个节点，且图的剩余部分完全一样。 可以将独立集问题归约到此问题。比如若要求任意图G(V,E)中大小为d的独立集，可以令G1=G(V,E),再令G2(V,Ø)的顶点集与G相同，但是边集为空，也即是各个顶点相
2017-12-31 23:24:15
469
原创 14. Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings. 分析 如果数组长度为1，最长前缀就是strs[0]。 如果数组长度为2，从头部开始，比较两个字符串的每个字符，当不相等时，返回最长前缀。 如果数组长度>2，将数组分为左右两部分，找出左半部分、右半部分的最长前缀，找出这
2017-12-15 14:44:53
104
原创 312. Burst Balloons
Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all the balloons. If the you burst balloon i you will get num
2017-12-15 14:36:58
106
原创 5. Longest Palindromic Substring
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example: Input: "babad" Output: "bab" Note: "aba" is also a valid answer.
2017-12-15 14:23:46
97
原创 241. Different Ways to Add Parentheses
Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are +, - and *. Example 1
2017-12-15 14:16:22
124
原创 32. Longest Valid Parentheses
Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring. For "(()", the longest valid parentheses substring is "()", wh
2017-12-15 00:19:41
107
原创 240. Search a 2D Matrix II
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 in ascending from left to right.Integers in
2017-12-07 01:19:21
87
原创 169. Majority Element
Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the array is non-empty and the majority element
2017-12-06 23:12:22
113
原创 53. Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [-2,1,-3,4,-1,2,1,-5,4], the contiguous subarray [4,-1,2,1] ha
2017-12-06 22:35:51
98
原创 730. Count Different Palindromic Subsequences
Given a string S, find the number of different non-empty palindromic subsequences in S, and return that number modulo 10^9 + 7. A subsequence of a string S is obtained by deleting 0 or more chara
2017-12-04 21:46:53
221
原创 673. Number of Longest Increasing Subsequence
Given an unsorted array of integers, find the number of longest increasing subsequence. Example 1: Input: [1,3,5,4,7] Output: 2 Explanation: The two longest increasing subsequence are [1, 3, 4,
2017-12-04 20:31:53
115
原创 689. Maximum Sum of 3 Non-Overlapping Subarrays
In a given array nums of positive integers, find three non-overlapping subarrays with maximum sum. Each subarray will be of size k, and we want to maximize the sum of all 3*k entries. Return t
2017-12-04 18:09:51
124
原创 647. Palindromic Substrings
Given a string, your task is to count how many palindromic substrings in this string. The substrings with different start indexes or end indexes are counted as different substrings even they consis
2017-11-20 00:58:23
111
原创 718. Maximum Length of Repeated Subarray
Given two integer arrays A and B, return the maximum length of an subarray that appears in both arrays. Example 1: Input: A: [1,2,3,2,1] B: [3,2,1,4,7] Output: 3 Explanation: The repeated sub
2017-11-19 20:58:22
105
原创 646. Maximum Length of Pair Chain
You are given n pairs of numbers. In every pair, the first number is always smaller than the second number. Now, we define a pair (c, d) can follow another pair (a, b) if and only if b . Chain
2017-11-05 23:48:45
87
原创 659. Split Array into Consecutive Subsequences
You are given an integer array sorted in ascending order (may contain duplicates), you need to split them into several subsequences, where each subsequences consist of at least 3 consecutive integers.
2017-10-29 19:36:42
312
原创 712. Minimum ASCII Delete Sum for Two Strings
Given two strings s1, s2, find the lowest ASCII sum of deleted characters to make two strings equal. Example 1: Input: s1 = "sea", s2 = "eat" Output: 231 Explanation: Deleting "s" from "sea" a
2017-10-29 19:27:14
192
原创 714. Best Time to Buy and Sell Stock with Transaction Fee
Your are given an array of integers prices, for which the i-th element is the price of a given stock on day i; and a non-negative integer fee representing a transaction fee. You may complete as
2017-10-29 17:34:28
174
原创 Find Largest Value in Each Tree Row
You need to find the largest value in each row of a binary tree. Example: Input: 1 / \ 3 2 / \ \ 5 3 9 Output: [1, 3, 9] TreeNode stru
2017-10-22 23:35:08
125
原创 Employee Importance
You are given a data structure of employee information, which includes the employee's unique id, his importance value and his direct subordinates' id. For example, employee 1 is the leader of emp
2017-10-15 21:49:38
175
原创 Course Schedule II
There are a total of n courses you have to take, labeled from 0 to n - 1. Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a p
2017-10-09 00:52:54
104
原创 Course Schedule
There are a total of n courses you have to take, labeled from 0 to n - 1. Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a p
2017-10-08 23:04:34
130
原创 Longest Increasing Path in a Matrix
Given an integer matrix, find the length of the longest increasing path. From each cell, you can either move to four directions: left, right, up or down. You may NOT move diagonally or move outside o
2017-10-08 22:47:12
162
原创 24 Game
You have 4 cards each containing a number from 1 to 9. You need to judge whether they could operated through *, /, +, -, (, ) to get the value of 24. Example 1: Input: [4, 1, 8, 7] Output: Tru
2017-09-24 19:16:06
117
原创 Top K Frequent Elements
iven a non-empty array of integers, return the k most frequent elements. For example, Given [1,1,1,2,2,3] and k = 2, return [1,2]. Note: You may assume k is always valid, 1 ≤ k ≤ number of un
2017-09-16 14:30:51
102
原创 Kth Largest Element in an Array
Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element. For example, Given [3,2,1,5,6,4] and k = 2, return 5. N
2017-09-16 12:42:23
119
原创 Ugly Number II
Write a program to find the n-th ugly number. Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 1, 2, 3, 4, 5, 6, 8, 9, 10, 12 is the sequence of the first 10
2017-09-16 12:25:40
112
原创 Merge k Sorted Lists
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. 方法１．最直接的做法就是每次都遍历众多链表的头节点，找出其中最小的一个．假设所有链表的长度为ｎ，那么该算法的时间复杂度为Ｏ（ｎ＾２）． 方法２．用这些链表建立一个最小堆，根节点保存的是最小头节点元素
2017-09-16 11:59:38
101
原创 Merge Two Sorted Lists
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 比较两个链表的第一个元素，将较小的元素放入新的链表中，向后移动该较小的链表头指针．算法时间复杂度为Ｏ（ｌ１．ｓｉｚ
2017-09-16 11:48:34
114
原创 Median of Two Sorted Arrays
There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). Example 1: nums1 = [1,
2017-09-09 18:21:23
112
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人