Dev #1

YearsAlso · 2025-07-30T12:24:08Z

This pull request introduces several significant updates, including the addition of GitHub Actions workflows for CI, IntelliJ IDEA project configuration files, and two new Java modules (classic-interview-001 and classic-interview-002) with corresponding implementations and unit tests. Below is a summary of the most important changes grouped by theme.

Continuous Integration

Added a dev.yml GitHub Actions workflow to run Java CI for the dev branch, including steps for code checkout, setting up JDK 21, caching Maven dependencies, compiling, testing, and packaging the project (.github/workflows/dev.yml).
Added a main.yml GitHub Actions workflow to run Java CI for the main and next branches, with similar steps to the dev.yml workflow (.github/workflows/main.yml).

IntelliJ IDEA Project Configuration

Added .gitignore entries for IntelliJ IDEA-specific files such as workspace.xml, shelf/, and httpRequests/ (.idea/.gitignore).
Introduced IntelliJ IDEA configuration files for project settings, including compiler settings, encoding, Maven repositories, and VCS mappings (.idea/compiler.xml, .idea/encodings.xml, .idea/jarRepositories.xml, .idea/misc.xml, .idea/setting.xml, .idea/vcs.xml) [1] [2] [3] [4] [5] [6].

Java Module: `classic-interview-001`

Added a Maven module classic-interview-001 with a merge solution for merging two sorted arrays, implemented in Solution.java (classic-interview/classic-interview-001/src/main/java/com/yearsalso/Solution.java).
Added unit tests for the merge solution, covering various edge cases and scenarios (classic-interview/classic-interview-001/src/test/java/com/yearsalso/SolutionTest.java).

Java Module: `classic-interview-002`

Added a Maven module classic-interview-002 with a removeElement solution for removing elements equal to a given value from an array, implemented in Solution.java (classic-interview/classic-interview-002/src/main/java/com/yearsalso/Solution.java).
Added unit tests for the removeElement solution, verifying functionality with different input cases (classic-interview/classic-interview-002/src/test/java/com/yearsalso/SolutionTest.java).

Miscellaneous

Added a minimal README.md update, though it remains largely unchanged (README.md).

- 创建项目结构和初始文件 - 添加三个经典面试题的解决方案 - 编写单元测试用例 - 配置 Maven 和 Idea 相关文件

…removeElement method

- 新增 classic-interview-004 模块 - 实现了有序数组去重算法，使得出现次数超过两次的元素只出现两次 - 添加了单元测试用例，覆盖了多种输入场景 - 更新了项目配置文件，支持新模块的编译和测试

- 移除了临时数组的使用，直接在原数组上进行操作 - 添加了 lastestVal 变量来记录最后一个出现的值 - 调整了计数逻辑，修复了重复元素的判断条件 - 增加了测试用例，验证数组内容的正确性

- 新增 classis-interview-005 模块 - 实现了寻找数组中多数元素的算法 - 添加了多个测试用例以验证算法的正确性 - 优化了 classic-interview-004 模块中的代码

- 新增经典面试题 006 模块，实现数组轮转功能 - 添加 Main 类和 Solution 类，实现基本的 Hello World 和数组轮转算法 - 新增单元测试类 SolutionTest，覆盖多种测试场景 - 更新项目配置文件，包括 pom.xml 和 IDEA 配置文件

- 重构 classic-interview 模块，更新文件结构和命名 - 添加 sword-to-offer 模块，包含多个子模块 - 更新项目配置文件，如 pom.xml 和 .idea 相关文件 - 新增多个解决方案类和测试类

Copilot

Pull Request Overview

This PR adds a comprehensive Java project structure for LeetCode practice problems, including CI/CD setup, IDE configuration, and multiple algorithm solutions with extensive test coverage.

Implements CI/CD workflows for automated testing and building across different branches
Adds complete Maven multi-module project structure for organizing algorithm solutions
Introduces multiple algorithm implementations with comprehensive unit tests covering various edge cases

Reviewed Changes

Copilot reviewed 62 out of 94 changed files in this pull request and generated 8 comments.

Show a summary per file

File	Description
`.github/workflows/*.yml`	GitHub Actions CI/CD workflows for automated testing on main/dev branches
`pom.xml` and module `pom.xml` files	Maven project configuration with multi-module structure
`classic-interview/*/src/main/java/com/yearsalso/Solution.java`	Algorithm implementations for classic interview problems (merge arrays, remove elements, etc.)
`sword-to-offer/*/src/main/java/org/sto/Solution.java`	Algorithm implementations for Sword-to-Offer problems (binary operations, array manipulations, etc.)
Test files across all modules	Comprehensive unit test suites with extensive edge case coverage

Files not reviewed (8)

.idea/.gitignore: Language not supported
.idea/ApifoxUploaderProjectSetting.xml: Language not supported
.idea/compiler.xml: Language not supported
.idea/encodings.xml: Language not supported
.idea/jarRepositories.xml: Language not supported
.idea/misc.xml: Language not supported
.idea/setting.xml: Language not supported
.idea/vcs.xml: Language not supported

Copilot · 2025-07-30T12:25:55Z

sword-to-offer/sword-to-offer-008/src/main/java/org/sto/Solution.java

+
+
+        System.out.println(target);
+        while (minSum > target && head < tail) {


The condition minSum > target is incorrect. The algorithm should continue while minSum >= target to find the shortest subarray that meets the requirement.

Suggested change

while (minSum > target && head < tail) {

while (minSum >= target && head < tail) {

Copilot · 2025-07-30T12:25:55Z

sword-to-offer/sword-to-offer-008/src/main/java/org/sto/Solution.java

+
+        System.out.println(target);
+        while (minSum > target && head < tail) {
+            if (nums[head] <= nums[tail]) {
+                head += 1;
+            } else {
+                tail -= 1;
+            }
+
+            minSum = getSum(nums, head, tail);
+        }
+
+
+        System.out.println("head = " + head + ", tail = " + tail);
+        if (tail == nums.length - 1 && minSum < target) {
+            return 0;
+        }
+        return head == tail ? 0 : tail - head + 1;


This condition is flawed. When tail == nums.length - 1, it doesn't necessarily mean the algorithm should return 0. The check should verify if any valid subarray was found.

Suggested change

System.out.println(target);

while (minSum > target && head < tail) {

if (nums[head] <= nums[tail]) {

head += 1;

} else {

tail -= 1;

}

minSum = getSum(nums, head, tail);

}

System.out.println("head = " + head + ", tail = " + tail);

if (tail == nums.length - 1 && minSum < target) {

return 0;

}

return head == tail ? 0 : tail - head + 1;

System.out.println(target);

while (tail < nums.length) {

minSum += nums[tail];

while (minSum >= target) {

minLength = Math.min(minLength, tail - head + 1);

minSum -= nums[head];

head++;

}

tail++;

}

System.out.println("head = " + head + ", tail = " + tail);

return minLength == Integer.MAX_VALUE ? 0 : minLength;

Copilot · 2025-07-30T12:25:55Z

sword-to-offer/sword-to-offer-008/src/main/java/org/sto/Solution.java

+    // 求数组和
+    public int getSum(int[] nums, int head, int tail) {
+        int sum = 0;
+        String result = "";
+        for (int i = head; i <= tail; i++) {
+            sum += nums[i];
+            result += nums[i] + ",";
+        }
+
+        System.out.println(result + " = " + sum);


Using string concatenation in a loop creates unnecessary String objects. This debug code should be removed in production as it impacts performance.

Suggested change

// 求数组和

public int getSum(int[] nums, int head, int tail) {

int sum = 0;

String result = "";

for (int i = head; i <= tail; i++) {

sum += nums[i];

result += nums[i] + ",";

}

System.out.println(result + " = " + sum);

private boolean isDebugEnabled() {

// Set to false in production to disable debug output

return true;

}

// 求数组和

public int getSum(int[] nums, int head, int tail) {

int sum = 0;

StringBuilder result = new StringBuilder();

for (int i = head; i <= tail; i++) {

sum += nums[i];

result.append(nums[i]).append(",");

}

if (isDebugEnabled()) {

System.out.println(result + " = " + sum);

}

Copilot · 2025-07-30T12:25:56Z

sword-to-offer/sword-to-offer-008/src/main/java/org/sto/Solution.java

+            result += nums[i] + ",";
+        }
+
+        System.out.println(result + " = " + sum);


Debug print statements should be removed from production code. Use a logging framework if debugging output is needed.

Suggested change

System.out.println(result + " = " + sum);

logger.log(Level.FINE, "{0} = {1}", new Object[]{result, sum});

Copilot · 2025-07-30T12:25:56Z

sword-to-offer/sword-to-offer-007/src/main/java/org/sto/Solution.java

+                    list.add(nums[j]);
+                    list.add(target);
+
+                    if (!result.contains(list)) {


Using List.contains() for duplicate checking has O(n) complexity, making the overall algorithm inefficient. Consider using a Set with a custom hash/equals implementation or a different deduplication strategy.

Suggested change

if (!result.contains(list)) {

String tripletKey = nums[i] + "," + nums[j] + "," + target;

if (!uniqueTriplets.contains(tripletKey)) {

uniqueTriplets.add(tripletKey);

Copilot · 2025-07-30T12:25:56Z

sword-to-offer/sword-to-offer-002/src/test/java/org/sto/SolutionTest.java

+
+import org.junit.jupiter.api.Test;
+
+import javax.sound.midi.Soundbank;


Unused import javax.sound.midi.Soundbank should be removed as it serves no purpose in this test class.

Suggested change

import javax.sound.midi.Soundbank;

// Line removed as it is an unused import.

Copilot · 2025-07-30T12:25:57Z

sword-to-offer/sword-to-offer-001/src/main/java/org/sto/Solution.java

+        if (result > Integer.MAX_VALUE || result < Integer.MIN_VALUE) {
+            return (int) (result - 1);


The overflow handling logic is incorrect. When result > Integer.MAX_VALUE, it should return Integer.MAX_VALUE, not result - 1. The current implementation will return an incorrect negative value due to integer overflow.

Suggested change

if (result > Integer.MAX_VALUE || result < Integer.MIN_VALUE) {

return (int) (result - 1);

if (result > Integer.MAX_VALUE) {

return Integer.MAX_VALUE;

} else if (result < Integer.MIN_VALUE) {

return Integer.MIN_VALUE;

Copilot · 2025-07-30T12:25:57Z

classic-interview/classic-interview-006/src/main/java/com/yearsalso/Solution.java

+
+        int[] temp = new int[length];
+
+        int destPos = length - n - 1;


The variable destPos is declared but never used. This unused variable should be removed to improve code clarity.

Suggested change

int destPos = length - n - 1;

- 删除了 .idea 文件夹及其所有内容，包括各种项目设置和配置文件 - 更新了 .gitignore 文件，添加 .idea 文件夹到忽略列表 - 调整了 classic-interview 和 sword-to-offer 的 pom.xml 文件

YearsAlso added 7 commits July 29, 2025 21:38

feat: 初始化 leetcode-notes 项目

790e58e

- 创建项目结构和初始文件 - 添加三个经典面试题的解决方案 - 编写单元测试用例 - 配置 Maven 和 Idea 相关文件

feat: add initial GitHub Actions CI configuration and unit tests for …

808fa29

…removeElement method

feat(classis-interview-005): 添加多数元素问题的解决方案

6ab4474

- 新增 classis-interview-005 模块 - 实现了寻找数组中多数元素的算法 - 添加了多个测试用例以验证算法的正确性 - 优化了 classic-interview-004 模块中的代码

feat(project): 重构项目并添加新模块

67f73ef

- 重构 classic-interview 模块，更新文件结构和命名 - 添加 sword-to-offer 模块，包含多个子模块 - 更新项目配置文件，如 pom.xml 和 .idea 相关文件 - 新增多个解决方案类和测试类

YearsAlso requested a review from Copilot July 30, 2025 12:24

YearsAlso self-assigned this Jul 30, 2025

YearsAlso added the enhancement New feature or request label Jul 30, 2025

Copilot AI reviewed Jul 30, 2025

View reviewed changes

chore: 移除 .idea 文件夹并更新项目配置

a04f9da

- 删除了 .idea 文件夹及其所有内容，包括各种项目设置和配置文件 - 更新了 .gitignore 文件，添加 .idea 文件夹到忽略列表 - 调整了 classic-interview 和 sword-to-offer 的 pom.xml 文件

YearsAlso merged commit 2df0113 into main Jul 30, 2025
2 checks passed

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Dev #1

Dev #1

Uh oh!

YearsAlso commented Jul 30, 2025

Uh oh!

Copilot AI left a comment

Uh oh!

Copilot AI Jul 30, 2025

Uh oh!

Copilot AI Jul 30, 2025

Uh oh!

Copilot AI Jul 30, 2025

Uh oh!

Copilot AI Jul 30, 2025

Uh oh!

Copilot AI Jul 30, 2025

Uh oh!

Copilot AI Jul 30, 2025

Uh oh!

Copilot AI Jul 30, 2025

Uh oh!

Copilot AI Jul 30, 2025

Uh oh!

Uh oh!

Reviewers

Assignees

Labels

Projects

Milestone

Development

Uh oh!

2 participants



		System.out.println(target);
		while (minSum > target && head < tail) {

	while (minSum > target && head < tail) {
	while (minSum >= target && head < tail) {

	System.out.println(result + " = " + sum);
	logger.log(Level.FINE, "{0} = {1}", new Object[]{result, sum});

-                    if (!result.contains(list)) {
+                    String tripletKey = nums[i] + "," + nums[j] + "," + target;
+                    if (!uniqueTriplets.contains(tripletKey)) {
+                        uniqueTriplets.add(tripletKey);


		import org.junit.jupiter.api.Test;

		import javax.sound.midi.Soundbank;

	import javax.sound.midi.Soundbank;
	// Line removed as it is an unused import.

		if (result > Integer.MAX_VALUE \|\| result < Integer.MIN_VALUE) {
		return (int) (result - 1);

-        if (result > Integer.MAX_VALUE || result < Integer.MIN_VALUE) {
-            return (int) (result - 1);
+        if (result > Integer.MAX_VALUE) {
+            return Integer.MAX_VALUE;
+        } else if (result < Integer.MIN_VALUE) {
+            return Integer.MIN_VALUE;

Dev #1

Dev #1

Uh oh!

Conversation

YearsAlso commented Jul 30, 2025

Continuous Integration

IntelliJ IDEA Project Configuration

Java Module: classic-interview-001

Java Module: classic-interview-002

Miscellaneous

Uh oh!

Copilot AI left a comment

Choose a reason for hiding this comment

Pull Request Overview

Reviewed Changes

Uh oh!

Copilot AI Jul 30, 2025

Choose a reason for hiding this comment

Uh oh!

Copilot AI Jul 30, 2025

Choose a reason for hiding this comment

Uh oh!

Copilot AI Jul 30, 2025

Choose a reason for hiding this comment

Uh oh!

Copilot AI Jul 30, 2025

Choose a reason for hiding this comment

Uh oh!

Copilot AI Jul 30, 2025

Choose a reason for hiding this comment

Uh oh!

Copilot AI Jul 30, 2025

Choose a reason for hiding this comment

Uh oh!

Copilot AI Jul 30, 2025

Choose a reason for hiding this comment

Uh oh!

Copilot AI Jul 30, 2025

Choose a reason for hiding this comment

Uh oh!

Uh oh!

Reviewers

Assignees

Labels

Projects

Milestone

Development

Uh oh!

2 participants

Java Module: `classic-interview-001`

Java Module: `classic-interview-002`