LeetCode 121. Best Time to Buy and Sell StockLeetCode-121 You are given an array prices where prices[i] is the price of

LeetCode 55. Jump GameLeetCode-55 You are given an integer array nums. You are initially positioned at the array’s first

LeetCode 208. Implement Trie (Prefix Tree)LeetCode-208 A trie (pronounced as “try”) or prefix tree is a tree data struct

LeetCode 14. Longest Common PrefixWrite a function to find the longest common prefix string amongst an array of strings.

LeetCode 235. Lowest Common Ancestor of a Binary Search TreeLeetCode-235 Given a binary search tree (BST), find the lowe

LeetCode 228. Summary RangesLeetCode-228 You are given a sorted unique integer array nums. Return the smallest sorted li

LeetCode 51. N-QueensLeetCode-51 The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that

LeetCode 198. House RobberLeetCode-198 You are a professional robber planning to rob houses along a street. Each house h

LeetCode 139. Word BreakLeetCode-139 Given a string s and a dictionary of strings wordDict, return true if s can be segm

GPOPS-II教程GPOPS结构自定义函数为了指定要解决的最优控制问题，用户必须编写以下MATLAB函数 端点函数endpoint fucntion，端点函数定义了阶段的起始点和/或终止点、阶段的积分以及静态参数之间的相互关系，还定义了

LeetCode 377. Combination Sum IVLeetCode-377 Given an array of distinct integers nums and a target integer target, retur

LeetCode 421. Maximum XOR of Two Numbers in an ArrayGiven an integer array nums, return the maximum result of nums[i] XO