码农学院

题目: Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the

命名变数 java规定变数前要加上型态，如下图。 Java命名规则，第一字为大写都是类别 基本资料型态 资料型态 | 关键字 | 位元数 | 範围 ------------- | -------

阵列(Array) 宣告一个阵列，并将阵列中的值丢进变数中。 int[] num = {1,2,4,8,16};int a = num[2] 指定阵列长度，再将数值丢进阵列相对应的位置。 int[] num = new int

命名变数 java规定变数前要加上型态，如下图。 Java命名规则，第一字为大写都是类别 基本资料型态 型态 | 命名 | 位元数 | 数值範围 ------------- | ----------

split 切割字串且型态变成字串阵列 String s = string1,string2,string3;String sa = s.split(,);System.out.println(s[0].trim()); 结果会印出string1， trim()为去空白 。 substring 显示相

由于前面几题easy觉得难度还可以负荷,因此开始尝试medium的题目 题目: You are given two non-empty linked lists representing two non-negative integers. The digits are stored in rev

题目: Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The relative order of the elements may be changed. Since it is impossible to change the length of

题目: Given two strings needle and haystack, return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. For the purpose of this problem, we will return 0

题目: Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You must write an

题目: Given a string s, find the length of the longest substring without repeating characters. 给定一个字串,回传其中最大的无重複字元字串长度 我们的第二题medium,题目简单暴

WAF 是什么? WAF (Web Application Firewall)，即是「网站应用程式防火墙」，WAF 透过拦截和监控网站流量同时阻止骇客攻击和恶意程式资料库保护网站应用程式，比