public class Test {
public static void main(String args[]) {
String string = args[0];
System.out.println("last character: " +
string.substring(string.length() - 1));
}
}
// Create an array with room for 100 integers
int[] nums = new int[100];
// Fill it with numbers using a for-loop
for (int i = 0; i < nums.length; i++)
nums[i] = i + 1; // +1 since we want 1-100 and not 0-99
// Compute sum
int sum = 0;
for (int n : nums)
sum += n;
// Print the result (5050)
System.out.println(sum);
public static void loopRecursive(String[] thisArray) {
if (thisArray.length <= 0) {
return;
}
System.out.println(thisArray[0]);
loopRecursive(Arrays.copyOfRange(thisArray, 1, thisArray.length));
}Input: n = 3, k = 27
Output: "aay"
Explanation: The numeric value of the string is 1 + 1 + 25 = 27, and it is the smallest string with such a value and length equal to 3.enum errorType { none = 0, minor1 = 1, minor2, major1 = 100, major2, fatal1 = 1000 };
* test: React StrictMode
* test: fix Spin test
* chore: wrapper enzyme
* test: fix setState
* test: more test cover
* test: more test cover
* test: more test cover
* test: more test cover
* test: more test cover
* test: more test case
* test: more test case
* test: more test case
* test: more test case
* test: more test case
* test: more test case
* test: more test case
* test: more test case
* test: more test case
* test: more test case
* test: more test case
* test: more test case
* test: disable part of it
* test: fix test & add placeholder
* test: Use orign enzyme mount
Co-authored-by: zombiej <smith3816@gmail.com>